Automated termination analysis of Java Bytecode by term rewriting

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 6, Issue , 2010, Pages 259-275

  Otto, Carsten ^a   Brockschmidt, Marc ^a   Von Essen, Christian ^a   Giesl, Jürgen ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Java Bytecode; Term rewriting; Termination

Indexed keywords

AUTOMATED APPROACH; AUTOMATED TERMINATION; JAVA BYTE CODES; OBJECT-ORIENTED LANGUAGES; TECHNIQUES AND TOOLS; TERM REWRITE SYSTEMS; TERM REWRITING; TERMINATION;

JAVA PROGRAMMING LANGUAGE;

EID: 84880200520     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. E. Albert, P. Arenas, M. Codish, S. Genaim, G. Puebla, and D. Zanardini. Termination analysis of Java Bytecode. In Proc. FMOODS '08, LNCS 5051, pages 2-18, 2008.
2. J. Berdine, B. Cook, D. Distefano, and P. O'Hearn. Automatic termination proofs for programs with shape-shifting heaps. In Proc. CAV '06, LNCS 4144, pages 386-400, 2006.
3. A. R. Bradley, Z. Manna, and H. B. Sipma. Termination of polynomial programs. In Proc. VMCAI '05, LNCS 3385, pages 113-129, 2005.
4. M. Colón and H. Sipma. Practical methods for proving program termination. In Proc. CAV '02, LNCS 2404, pages 442-454, 2002.
5. B. Cook, A. Podelski, and A. Rybalchenko. Termination proofs for systems code. In Proc. PLDI '06, pages 415-426. ACM Press, 2006.
6. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. POPL '77, pages 238-252. ACM Press, 1977.
7. S. Falke and D. Kapur. A term rewriting approach to the automated termination analysis of imperative programs. In Proc. CADE '09, LNAI 5663, pages 277-293, 2009.
8. C. Fuhs, J. Giesl, M. Pl̈ucker, P. Schneider-Kamp, and S. Falke. Proving termination of integer term rewriting. In Proc. RTA '09, LNCS 5595, pages 32-47, 2009.
9. J. Giesl, P. Schneider-Kamp, and R. Thiemann. AProVE 1.2: Automatic termination proofs in the dependency pair framework. In Proc. IJCAR '06, LNAI 4130, pages 281-286, 2006.
10. J. Giesl, S. Swiderski, P. Schneider-Kamp, and R. Thiemann. Automated termination analysis for Haskell: From term rewriting to programming languages. In RTA '06, LNCS 4098, pp. 297-312, 2006.
11. J. Gosling, B. Joy, G. Steele, and G. Bracha. The Java Language Specification. Addison Wesley, 2005.
12. S. Gulwani, K. Mehra, and T. Chilimbi. SPEED: Precise and efficient static estimation of program computational complexity. In Proc. POPL '09, pages 127-139. ACM Press, 2009.
13. G. Klein and T. Nipkow. A machine-checked model for a Java-like language, virtual machine, and compiler. ACM Transactions on Programming Languages and Systems, 28(4):619-695, 2006.
14. T. Lindholm and F. Yellin. Java Virtual Machine Specification. Prentice Hall, 1999.
15. M. T. Nguyen, D. De Schreye, J. Giesl, and P. Schneider-Kamp. Polytool: Polynomial interpretations as a basis for termination analysis of logic programs. Theory and Practice of Logic Programming, 2010. To appear. Available from http://arxiv.org/pdf/0912.4360.
16. C. Otto, M. Brockschmidt, C. von Essen, and J. Giesl. Automated termination analysis of Java Bytecode by term rewriting. Technical Report AIB-2010-08, RWTH Aachen, 2010. http://aib.informatik.rwth-aachen.de.
17. P. Schneider-Kamp, J. Giesl, A. Serebrenik, and R. Thiemann. Automated termination proofs for logic programs by term rewriting. ACM Transactions on Computational Logic, 11(1), Article 2, 2009.
18. M. H. Sørensen and R. Gluck. An algorithm of generalization in positive supercompilation. In Proc. ILPS '95, pages 465-479. MIT Press, 1995.
19. F. Spoto, F. Mesnard, and E. Payet. A termination analyser for Java Bytecode based on path-length. ACM Transactions on Programming Languages and Systems, 32(3), Article 8, 2010.