The Size-Change Principle for Program Termination (2001)

Cached

Download Links

by Chin Soon Lee , Neil D. Jones , Amir M. Ben-amram
Citations:176 - 11 self

Documents Related by Co-Citation

113 A complete method for the synthesis of linear ranking functions – A Podelski, A Rybalchenko
58 Practical methods for proving program termination – Michael A. Col'on, Henny B. Sipma - 2002
52 Termination of polynomial programs – Aaron R. Bradley, Zohar Manna, Henny B. Sipma - 2005
90 Transition Invariants – Andreas Podelski, Andrey Rybalchenko
52 Automated Termination Proofs with AProVE – Jürgen Giesl, René Thiemann, Peter Schneider-kamp, Stephan Falke - 2004
210 Termination of Term Rewriting Using Dependency Pairs – Thomas Arts, Jürgen Giesl - 2000
64 Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming – Patrick Cousot - 2005
41 A General Framework for Automatic Termination Analysis of Logic Programs – Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik - 2000
42 Termination of Linear Programs – Ashish Tiwari - 2004
48 Abstraction refinement for termination – Byron Cook, Andreas Podelski, Andrey Rybalchenko
100 A Semantic Basis for the Termination Analysis of Logic Programs – Michael Codish, Cohavit Taboch - 1999
454 Rewriting – Nachum Dershowitz, David A. Plaisted - 2001
50 Synthesis of linear ranking functions – M Colón, H Sipma
134 Termination proofs for systems code – Byron Cook, Andreas Podelski, Andrey Rybalchenko - 2006
22 Improved Modular Termination Proofs Using Dependency Pairs – Rene Thiemann, Jürgen Giesl, Peter Schneider-kamp - 2004
45 Modular termination proofs for rewriting using dependency pairs – J Giesl, T Arts, E Ohlebusch - 2002
20 Improving Dependency Pairs – Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke - 2003
59 Automating the dependency pair method – Nao Hirokawa, Aart Middeldorp - 2003
46 Deductive Model Checking – Henny B. Sipma, Tomás E. Uribe, Zohar Manna - 1998