Two new strategies for developing loop invariants and their applications
| Autor: | Xue Jin-yun |
|---|---|
| Rok vydání: | 1993 |
| Předmět: |
Mathematical optimization
Sequence Loop invariant Recurrence relation Computer science Program derivation Computer Science Applications Theoretical Computer Science Variety (cybernetics) Dynamic programming Computational Theory and Mathematics Hardware and Architecture Theory of computation Algorithm design Software |
| Zdroj: | Journal of Computer Science and Technology. 8:147-154 |
| ISSN: | 1860-4749 1000-9000 |
| DOI: | 10.1007/bf02939477 |
| Popis: | 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 problems, 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink