Termination analysis with calling context graphs

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

Volumn 4144 LNCS, Issue , 2006, Pages 401-414

  Manolios, Panagiotis ^a   Vroon, Daron ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; RECURSIVE FUNCTIONS; REGRESSION ANALYSIS; THEOREM PROVING;

ACL2 PROGRAMMING LANGUAGE; CALLING CONTEXT GRAPHS; LOOPING BEHAVIOR; PROGRAM TERMINATION;

GRAPH THEORY;

EID: 33749828540     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817963_36     Document Type: Conference Paper

References (21)

1. Andrew W. Appel. SSA is functional programming. SICP LAN Not., 33(4): 17-20, 1998.
2. Thomas Arts and Jürgen Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133-178, 2000.
3. Aaron R. Bradley, Zohar Manna, and Henny B. Sipma, Termination of polynomial programs. In Cousot [7], pages 113-129.
4. M, Codish and C. Taboch. A semantic basis for the termination analysis of logic programs. The Journal of Logic Programming, 41(1):103-123, 1999.
5. Byron Cook, Andreas Podelski, and Andrey Rybalchenko. Abstraction refinement for termination. In Static Analysis: 12th International Symposium, SAS 2005, volume 3672 of LNCS, pages 87-102, September 2005.
6. Patrick Cousot. Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming, In Cousot [7], pages 1-24.
7. Radhia Cousot, editor. Verification, Model Checking, and Abstract Interpretation, 6th International Conference, VMCAI 2005, Paris, France, January 17-19, 2005, Proceedings, volume 3385 of Lecture Notes in Computer Science. Springer, 2005.
8. J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Automated termination proofs with AProVE. In Proceedings of the 15th International Conference on Rewriting Techniques and Applications (RTA-04), volume 3091 of LNCS, pages 210-220. Springer-Verlag, 2004.
9. Matt Kaufmann, Panagiotis Manolios, and J Strother Moore, editors. Computer-Aided Reasoning: ACL2 Case Studies. Kluwer Academic Publishers, June 2000.
10. Matt Kaufmann, Panagiotis Manolios, and J Strother Moore. Computer-Aided Reasoning; An Approach. Kluwer Academic Publishers, July 2000.
11. Matt Kaufmann and J Strother Moore. ACL2 homepage. See URL http: //www.cs.-utexas.edu/users/moore/ac12.
12. Matt Kaufmann and J. Strother Moore. Structured theory development for a mechanized logic. J. Autom. Reason., 26(2): 161-203, 2001.
13. Chin Soon Lee, Neil D. Jones, and Amir M. Ben-Amram. The size-change principle for program termination. In ACM Symposium on Principles of Programming Languages, volume 28, pages 81-92. ACM Press, 2001.
14. Panagiotis Manolios and Daron Vroon. Ordinal arithmetic: Algorithms and mechanization, Journal Of Automated Reasoning. To Appear.
15. Panagiotis Manolios and Daron Vroon. Algorithms for ordinal arithmetic. In Franz Baader, editor, 19th International Conference on Automated Deduction - CADE-19, volume 2741 of LNAI, pages 243-257. Springer-Verlag, July/August 2003.
16. Panagiotis Manolios and Daron Vroon. Ordinal arithmetic in ACL2. In Matt Kaufmann and J Strother Moore, editors, Fourth International Workshop on the ACL2 Theorem Prover and Its Applications (ACL2-2003), July 2003. See URL http://www.cs.utexas.edu/-users/moore/ac12/workshop-2003/.
17. Panagiotis Manolios and Daron Vroon. Integrating reasoning about ordinal arithmetic into ACL2. In Formal Methods in Computer-Aided Design: 5th International Conference - FMCAD-2004, LNCS. Springer-Verlag, November 2004.
18. Panagiotis Manolios and Daron Vroon. Integrating static analysis and general-purpose theorem proving for termination analysis. In ICSE'06, The 28th international Conference on Softwar Engineering, Emerging Results. ACM, May 2006.
19. Andreas Podelski and Andrey Rybalchenko. A complete method for the synthesis of linear ranking functions. In VMCAI, pages 239-251, 2004.
20. A. Tiwari. Termination of linear programs. In R. Alur and D. Peled, editors, Computer-Aided Verification, CAV, volume 3114 of LNCS, pages 70-82. Springer, July 2004.
21. Alan Turing. On computable numbers, with an application to the entscheidungsproblem. In Proceedings of the London Mathematical Society, volume 42 of Series 2, pages 230-265, 1936.