A complete method for the synthesis of linear ranking functions

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

Volumn 2937, Issue , 2004, Pages 239-251

  Podelski, Andreas ^a   Rybalchenko, Andrey ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; INFORMATION RETRIEVAL;

AUTOMATED METHODS; LINEAR RANKING; LIVENESS PROPERTIES; SYSTEM OF LINEAR INEQUALITIES;

MODEL CHECKING;

EID: 84944228451     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24622-0_20     Document Type: Conference Paper

References (18)

1. Nikolaj Bjørner, Anca Browne, and Zohar Manna. Automatic generation of invariants and intermediate assertions. Theoretical Computer Science, 173(1):49-87, 1997.
2. Olaf Burkart and Bernhard Steffen. Model checking the full modal mucalculus for infinite sequential processes. Theoretical Computer Science, 221:251-270, 1999.
3. Patrick Cousot and Nicolas Halbwachs. Automatic discovery of linear restraints among variables of a program. In Proc. of POPL 1978: Symp. on Principles of Programming Languages, pages 84-97. ACM Press, 1978.
4. Michael Colon and Henny Sipma. Synthesis of linear ranking functions. In Tiziana Margaria and Wang Yi, editors, Proc. of TACAS 2001: Tools and Algorithms for the Construction and Analysis of Systems, volume 2031 of LNCS, pages 67-81. Springer-Verlag, 2001.
5. Michael Colon and Henny Sipma. Practical methods for proving program termination. In Ed Brinksma and Kim Guldstrand Larsen, editors, Proc. of CAV 2002: Computer Aided Verification, volume 2404 of LNCS, pages 442-454. Springer-Verlag, 2002.
6. Dennis Dams, Rob Gerth, and Orna Grumberg. A heuristic for the automatic generation of ranking functions. In Workshop on Advances in Verification (WAVe’00), pages 1-8, 2000.
7. Edsger W Dijkstra. A Discipline of Programming. Prentice Hall Series in Automatic Computation. Prentice Hall, Englewood Cliffs, NJ, 1976.
8. Samir Genaim, Michael Codish, John P. Gallagher, and Vitaly Lagoon. Combining norms to prove termination. In Agostino Cortesi, editor, Proc. of VMCAI 2002: Verification, Model Checking, and Abstract Interpretation, volume 2294 of LNCS, pages 126-138. Springer-Verlag, 2002.
9. Gene H. Golub and Charles F Van Loan. Matrix Computations; 3rd edition. Johns Hopkins Univ Press, 3rd edition, 1996.
10. Christian Holzbaur. OFAI clp(q,r) Manual, Edition 1.3.3. Austrian Research Institute for Artificial Intelligence, Vienna, 1995. TR-95-09.
11. Michael Karr. Affine relationships among variables of a program. Acta Informatica, 6:133-151, 1976.
12. The Intelligent Systems Laboratory. SICStus Prolog User’s Manual. Swedish Institute of Computer Science, PO Box 1263 SE-164 29 Kista, Sweden, October 2001. Release 3.8.7.
13. Fred Mesnard. Inferring left-terminating classes of queries for constraint logic programs. In Michael J. Maher, editor, Proc. of JICSLP 1996: Joint Int. Conf. and Symp. on Logic Programming, pages 7-21. MIT Press, 1996.
14. Fred Mesnard and Ulrich Neumerkel. Applying static analysis techniques for inferring termination conditions of logic programs. In Patrick Cousot, editor, Proc. of SAS 2001: Symp. on Static Analysis, volume 2126 of LNCS, pages 93-110. Springer-Verlag, 2001.
15. Andreas Podelski and Andrey Rybalchenko. Software model checking of liveness properties via transition invariants. Technical report, Max-Plank- Institut für Informatik, 2003.
16. William H. Press, Saul A. Teukolsky, William T. Vetterling, and Brian P. Flannery. Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, 1992.
17. Alexander Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons Ltd., 1986.
18. Kirack Sohn and Allen Van Gelder. Termination detection in logic programs using argument sizes. In Proc. of PODS 1991: Symp. on Principles of Database Systems, pages 216-226. ACM Press, 1991.