Practical methods for proving program termination

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2404, Issue , 2002, Pages 442-454

  Colón, Michael A ^a   Sipma, Henny B ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; INFORMATION RETRIEVAL; ITERATIVE METHODS;

FORWARD PROPAGATION; LINEAR COMBINATIONS; POLYHEDRAL CONE; PRACTICAL METHOD; PROGRAM TERMINATION; PROGRAM VARIABLES; RANKING FUNCTIONS; SINGLE VARIABLE;

HEURISTIC PROGRAMMING;

EID: 84937566009     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45657-0_36     Document Type: Conference Paper

References (16)

1. Nikolaj S. Bjørner, Anca Browne, Michael Colón, Bernd Finkbeiner, Zohar Manna, Henny B. Sipma, and Tomás E. Uribe. Verifyingt emporal properties of reactive systems: A STeP tutorial. Formal Methods in System Design, 16(3):227–270, June 2000.
2. J. Brauburger and J. Giesl. Approximatingthe domains of functional and imperative programs. Science of Computer Programming, 35:113–136, 1999.
3. G. E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In H. Brakhage, editor, Proc. Second GI Conf. Autamata Theory and Formal Languages, volume 33 of Lecture Notes in Computer Science, pages 134–183, 1975.
4. Michael Colón and Henny Sipma. Synthesis of linear rankingf unctions. In Tiziana Margaria and Wang Yi, editors, 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), volume 2031 of LNCS, pages 67–81. Springer Verlag, April 2001.
5. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. McGraw-Hill, New York, 1990.
6. Patrick Cousot and Rhadia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th ACM Symp. Princ. of Prog. Lang., pages 238–252. ACM Press, 1977.
7. Patrick Cousot and Nicholas Halbwachs. Automatic discovery of linear restraints amongt he variables of a program. In 5th ACM Symp. Princ. of Prog. Lang., pages 84–97, January 1978.
8. Dennis Dams, Rob Gerth, and Orna Grumberg. A heuristic for the automatic generation of rankingfu nctions. In Workshop on Advances in Verification (WAVe’00), pages 1–8, 2000.
9. N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3:69–116, 1987.
10. K. Fukuda and A. Prodon. Double description method revisited. In Combinatorics and Computer Science, volume 1120 of Lecture Notes in Computer Science, pages 91–111. Springer-Verlag, 1996.
11. J. Giesl. Generating polynomial orderings for termination proofs. In J. Hsiang, editor, Proc. 6th Intl. Conf. Rewriting Techniques and Applications, volume 914 of Lecture Notes in Computer Science, pages 426–431. Springer-Verlag, 1995.
12. J. Giesl, C. Walther, and J. Brauburger. Termination analysis for functional programs. In W. Bibel and P. H. Schmitt, editors, Automated Deduction – A Basis for Applications, Volume III: Applications, chapter 6, pages 135–164. Kluwer Academic, 1998.
13. Zohar Manna. Mathematical Theory of Computation. McGraw-Hill, 1974.
14. Zohar Manna and Amir Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
15. D. de Schreye and S. Decorte. Termination of logic programs: The never ending story. Journal of Logic Programming, 19, 20:199–260, 1994.
16. Niklaus Wirth. Algorithms + Data Structures = Programs. Prentice-Hall, 1976.