Using CLP Simplifications to Improve Java Bytecode Termination Analysis

Electronic Notes in Theoretical Computer Science

Volumn 253, Issue 5, 2009, Pages 129-144

  Spoto, Fausto ^a   Lu, Lunjin ^b   Mesnard, Fred ^c  

^a UNIVERSITY OF VERONA   (Italy)

^b OAKLAND UNIVERSITY   (United States)

^c UNIVERSITÉ DE LA RÉUNION   (France)

Author keywords

Java; Java bytecode; static analysis; termination

Indexed keywords

CONSTRAINT LOGIC PROGRAMS; JAVA; JAVA BYTE CODES; PROGRAM SIMPLIFICATION; TERMINATION ANALYSIS; TERMINATION PROOF;

JAVA PROGRAMMING LANGUAGE; LOGIC PROGRAMMING; STATIC ANALYSIS;

COMPUTER SOFTWARE;

EID: 71649111873     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2009.11.019     Document Type: Article

References (18)

1. Aho A.V., Sethi R., and Ullman J.D. Compilers, Principles Techniques and Tools (1986), Addison Wesley Publishing Company
2. Albert E., Arenas P., Genaim S., Puebla G., and Zanardini D. Removing Useless Variables in Cost Analysis of Java Bytecode. In: Wainwright R.L., and Haddad H. (Eds). Proc. of the 2008 ACM Symposium on Applied Computing (SAC'08). Fortaleza, Ceara, Brazil (March 2008), ACM 368-375
3. Ben-Amram A.M., and Codish M. A SAT-Based Approach to Size Change Termination with Global Ranking Functions. In: Ramakrishnan C.R., and Rehof J. (Eds). Proc. of the 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'08). Budapest, Hungary. Lecture Notes in Computer Science volume 4963 (2008), Springer 218-232
4. Berdine J., Chawdhary A., Cook B., Distefano D., and O'Hearn P.W. Variance Analyses from Invariance Analyses. In: Hofmann M., and Felleisen M. (Eds). Proc. of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'07). Nice, France (January 2007) 211-224
5. Berdine J., Cook B., Distefano D., and O'Hearn P.W. Automatic Termination Proofs for Programs with Shape-Shifting Heaps. In: Ball T., and Jones R.B. (Eds). Proc. of the 18th International Conference on Computer Aided Verification (CAV'06). Seattle, WA, USA. Lecture Notes in Computer Science volume 4144 (August 2006), Springer 386-400
6. Bouajjani A., Bozga M., Habermehl P., Iosif R., Moro P., and Vojnar T. Programs with Lists Are Counter Automata. In: Ball T., and Jones R.B. (Eds). Proc. of the 18th International Conference on Computer Aided Verification (CAV'06). Seattle, WA, USA. Lecture Notes in Computer Science volume 4144 (August 2006), Springer 517-531
7. Codish M. Proving Termination with (Boolean) Satisfaction. In: King A. (Ed). Proc. of the 17th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR'07). Kongens Lyngby, Denmark. Lecture Notes in Computer Science volume 4915 (2007), Springer 1-7
8. Codish M., and Taboch C. A Semantics Basis for Termination Analysis of Logic Programs. Journal of Logic Programming 41 1 (1999) 103-123
9. Cook B., Podelski A., and Rybalchenko A. Terminator: Beyond Safety. In: Ball T., and Jones R.B. (Eds). Proc. of the 18th International Conference on Computer Aided Verification (CAV'06). Seattle, WA, USA. Lecture Notes in Computer Science volume 4144 (August 2006), Springer 415-418
10. Genaim S., and Codish M. Inferring Termination Conditions for Logic Programs using Backwards Analysis. Theory and Practice of Logic Programming (TPLP) 5 1-2 (2005) 75-91
11. Giesl J., Schneider-Kamp P., and Thiemann R. Automatic Termination Proofs in the Dependency Pair Framework. In: Furbach U., and Shankar N. (Eds). 3th International Joint Conference on Automated Reasoning (IJCAR'06). Seattle, WA, USA. Lecture Notes in Computer Science volume 4130 (August 2006), Springer 281-286
12. TM Virtual Machine Specification. second edition (1999), Addison-Wesley
13. Loginov A., Reps T.W., and Sagiv M. Refinement-Based Verification for Possibly-Cyclic Lists. In: Reps T.W., Sagiv M., and Bauer J. (Eds). Proc. of Theory and Practice of Program Analysis and Compilation, Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday. Lecture Notes in Computer Science volume 4444 (2006), Springer 247-272
14. Manolios P., and Vroon D. Termination Analysis with Calling Context Graphs. In: Ball T., and Jones R.B. (Eds). Proc. of the 18th International Conference on Computer Aided Verification (CAV'06). Seattle, WA, USA. Lecture Notes in Computer Science volume 4144 (August 2006), Springer 401-414
15. Podelski A., and Rybalchenko A. Transition Predicate Abstraction and Fair Termination. ACM Transactions on Programming Languages and Systems (TOPLAS) 29 3 (May 2007)
16. F. Spoto, P. M. Hill, and É. Payet. Path-Length Analysis for Object-Oriented Programs. In First International Workshop on Emerging Applications of Abstract Interpretation (EAAI'06), Vienna, Austria, March 2006. Available at the web address http://profs.sci.univr.it/~spoto/papers.html
17. F. Spoto, F. Mesnard, and É. Payet. A Termination Analyser for Java Bytecode Based on Path-Length. Submitted for publication in September 2007. Available at the web address http://profs.sci.univr.it/~spoto/papers.html
18. Turing A. On Computable Numbers, with an Application to the Entscheidungsproblem. London Mathematical Society 42 2 (1936) 230-265