%0 Journal Article
%T Two New Strategies for Developing Loop Invariants and Their Applications
%A Xue Jinyun Computer Science
%A <br>Xue
%A Jinyun
%J 计算机科学技术学报
%D 1993
%I 
%X The loop invariants take a very important role in the design,proof and derivation of the algorithmic program.We point out the limitations of the traditional standard strategy for developing loop invariants, and propose two new strategies for proving the existing algorithmic program and developing new ones. The strategies use recurrence as vehicle and integrate some effective methods of designing algorithms, e.g.Dynamic Programming,Greedy and Divide Conquer,into the recurrence relation of problem solving sequence.This lets us get straightforward an approach for solving a variety of complicated prob- lems,and makes the standard proof and formal derivation of their algorithmic programs possible.We show the method and advantages of applying the strategies with several typical nontrivial examples.
%K Loop invariant
%K standard proof and formal derivation of program
%K recurrence relation
%K algorithm design<br>程序设计语言
%K 算法设计
%K 循环不变量
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=C6785F892AE70DEF0FCEBF7D3562947E&yid=D418FDC97F7C2EBA&vid=5D311CA918CA9A03&iid=0B39A22176CE99FB&sid=987EDA49D8A7A635&eid=9FFCC7AF50CAEBF7&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=14&reference_num=3