Integrating static analysis and general-purpose theorem proving for termination analysis

Proceedings - International Conference on Software Engineering

Volumn 2006, Issue , 2006, Pages 873-876

  Manolios, Panagiotis ^a   Vroon, Daron ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

ACL2; Liveness; Static analysis; Termination; Theorem proving

Indexed keywords

ALGORITHMS; INTEGRATION; QUERY LANGUAGES; SOFTWARE ENGINEERING; THEOREM PROVING;

GENERAL PURPOSE STATIC ANALYSES; SOFTWARE SYSTEMS; TERMINATION ANALYSIS; THEOREM PROVING QUERIES;

STATIC ANALYSIS;

EID: 34247110451     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1134285.1134438     Document Type: Conference Paper

References (18)

1. Andrew W. Appel. SSA is functional programming. SIGPLAN 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. Thomas Ball and Sriram K. Rajamani. Automatically validating temporal safety properties of interfaces. In Spin 2001, Workshop on Model Checking Software, volume 2057 of LNCS, pages 103 - 122. Springer-Verlag, May 2001.
4. Aaron R. Bradley, Zohar Manna, and Henny B. Sipma. Termination of polynomial programs. In Cousot [6], pages 113-129.
5. Patrick Cousot. Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming. In Cousot [6], pages 1-24.
6. Radhia Cousot, editor. Verification, Model Checking, and Abstract Interpretation, 6th International Conference, VMCAI 2005, volume 3385 of Lecture Notes in Computer Science. Springer, 2005.
7. Cormac Flanagan, K. Rustan M. Leino, Mark Lillibridge, Greg Nelson, James B. Saxe, and Raymie Stata. Extended static checking for Java. In PLDI'02: Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, pages 234-245, New York, NY, USA, 2002. ACM Press.
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/acl2.
12. 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.
13. Panagiotis Manolios and Daron Vroon. Ordinal arithmetic: Algorithms and mechanization. Journal Of Automated Reasoning. To Appear.
14. 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.
15. Panagiotis Manolios and Daron Vroon. Ordinal arithmetic in ACL2. In Matt Kaufmann and J Strother Moore, editors, Fourth International Workshop on the ACLS Theorem Prover and Its Applications (ACL2-2003), July 2003. See URL http://www.cs.utexas.edu/users/moore/acl2/workshop-2003/.
16. 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.
17. Andreas Podelski and Andrey Rybalchenko. A complete method for the synthesis of linear ranking functions. In Verification, Model Checking, and Abstract Interpretation, 5th International Conference, VMCAI 2004, volume 2937 of Lecture Notes in Computer Science, pages 239-251. Springer, 2004.
18. Reneé Thiemann and Jürgen Giesl. Size-change termination for term rewriting. Technical Report AIB-2003-02, RWTH Aachen, January 2003.