A termination analyzer for Java bytecode based on path-length

ACM Transactions on Programming Languages and Systems

Volumn 32, Issue 3, 2010, Pages

  Spoto, Fausto ^a   Mesnard, Fred ^b   Payet, Étienne ^b  

^a UNIVERSITY OF VERONA   (Italy)

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

Author keywords

Abstract interpretation; Java; Java bytecode; Termination analysis

Indexed keywords

ABSTRACT INTERPRETATIONS; ALIASING; BYTECODES; COMPUTER PROGRAM; CONSTRAINT LOGIC PROGRAMS; CRITICAL SYSTEMS; CYCLICITY; DENOTATIONAL SEMANTICS; JAVA BYTE CODES; PATH LENGTH; PROGRAM PROPERTIES; TERMINATION ANALYSIS;

ABSTRACTING; DATA STRUCTURES; LOGIC PROGRAMMING; PROGRAM INTERPRETERS; SOFTWARE AGENTS; TELECOMMUNICATION EQUIPMENT; TELEPHONE SYSTEMS;

JAVA PROGRAMMING LANGUAGE;

EID: 77949565529     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1709093.1709095     Document Type: Article

References (103)

1. AHO, A. V., SETHI, R., ANDULLMAN, J.D. 1986. Compilers, Principles Techniques and Tools. Addison Wesley.
2. AHRENDT, W., BAAR, T., BECKERT, B., BUBEL, R., GIESE, M., HÄHNLE, R., MENZEL, W., MOSTOWSKI, W., ROTH, A., SCHLAGER, S., AND SCHMITT, P. H. 2005. The KeY Tool. Softw. Syst. Model. 4, 1, 32-54.
3. ALBERT, E., ARENAS, P., CODISH, M., GENAIM, S., PUEBLA, G., AND ZANARDINI, D. 2007a. Termination analysis of Java bytecode. In Proceedings of the 9th International Workshop on Termination (WST'07). A. Serebrenik and D. Hofbauer, Eds.
4. ALBERT, E., ARENAS, P., CODISH, M., GENAIM, S., PUEBLA, G., AND ZANARDINI, D. 2008. Termination analysis of Java bytecode. In Proceedings of the International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS'08). G. Barthe and F. S. de Boer, Eds. Lecture Notes in Computer Science, vol.5051. Springer, 2-18.
5. ALBERT, E., ARENAS, P., GENAIM, S., PUEBLA, G., AND ZANARDINI, D. 2007b. Cost analysis of java bytecode. In Proceedings of the 16th European Symposium on Programming (ESOP'07). R. De Nicola, Ed. Lecture Notes in Computer Science, vol.4421. Springer, 157-172.
6. AVERY, J. 2006. Size-Change termination and bound analysis. In Proceedings of the 8th International Symposium on Functional and Logic Programming (FLOPS'06).M. Hagiya and P.Wadler, Eds. Lecture Notes in Computer Science, vol.3945. Springer, 192-207.
7. BABIC, D., HU, A. J., RAKAMARIC, Z., AND COOK, B. 2007. Proving termination by divergence. In Proceedings of the 5th IEEE International Conference on Software Engineering and Formal Methods (SEFM'07). IEEE Computer Society, 93-102.
8. BACON, D. F. AND SWEENEY, P. F. 1996. Fast static analysis of c++ virtual function calls. In Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA'96). ACM SIGPLAN Not. 31, 10, ACM, 324-341.
9. BAGNARA, R.,HILL, P. M., RICCI, E., AND ZAFFANELLA, E. 2005. Precise widening operators for convex polyhedra. Sci. Comput. Program. 58, 1-2, 28-56.
10. BAGNARA, R., HILL, P. M., AND ZAFFANELLA, E. 2008. The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Sci. Comput. Program. 72, 1-2, 3-21.
11. BANNWART, F. AND MÜLLER, P. 2005. A program logic for bytecode. Electr. Not. Theor. Comput. Sci. 141, 1, 255-273.
12. BARNETT, M., CHANG, B.-Y. E., DELINE, R., JACOBS, B., AND LEINO, K. R. M. 2005. Boogie: A modular reusable verifier for object-oriented programs. In Proceedings of the 4th International Symposium on Formal Methods for Components and Objects (FMCO'05). F. S. de Boer, M. M. Bonsangue, S. Graf, and W. P. de Roever, Eds. Lecture Notes in Computer Science, vol.4111. Springer, 364-387.
13. BEN-AMRAM, A. M. AND LEE, C. S. 2007. Program termination analysis in polynomial time. ACM Trans. Program. Lang. Syst. 29, 1.
14. BERDINE, J., CALCAGNO, C., COOK, B., DISTEFANO, D., O'HEARN, P. W., WIES, T., AND YANG, H. 2007a. Shape analysis for composite data structures. In Proceedings of the 19th International Conference on Computer Aided Verification (CAV'07). W. Damm and H. Hermanns, Eds. Lecture Notes in Computer Science, vol.4590. Springer, 178-192.
15. BERDINE, J., CHAWDHARY, A., COOK, B., DISTEFANO, D., AND O'HEARN, P.W. 2007b. Variance analyses from invariance analyses. In Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'07). M. Hofmann and M. Felleisen, Eds. 211-224.
16. BERDINE, J., COOK, B., DISTEFANO, D., AND O'HEARN, P. W. 2006. Automatic termination proofs for programs with shape-shifting heaps. In Proceedings of the 18th International Conference on Computer Aided Verification (CAV'06). T. Ball and R. B. Jones, Eds. Lecture Notes in Computer Science, vol.4144. Springer, 386-400.
17. BOUAJJANI, A., BOZGA, M., HABERMEHL, P., IOSIF, R., MORO, P., AND VOJNAR, T. 2006. Programs with lists are counter automata. In Proceedings of the 18th International Conference on Computer Aided Verification (CAV'06). T. Ball and R. B. Jones, Eds. Lecture Notes in Computer Science, vol.4144. Springer, 517-531.
18. BRADLEY, A., MANNA, Z., AND SIPMA, H. 2005. Termination of polynomial programs. In Proceedings of the 6th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'05). R. Cousot, Ed. Lecture Notes in Computer Science, vol.3385. Springer, 113-129.
19. BRODSKY, A. AND SAGIV, Y. 1989. Inference of monotonicity constraints in datalog programs. In Proceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM Press, 190-199.
20. BROTHERSTON, J., BORNAT, R., AND CALCAGNO, C. 2008. Cyclic proofs of program termination in separation logic. In Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'08). G. C. Necula and P. Wadler, Eds. ACM, 101-112.
21. BRYANT, R. E. 1986. Graph-Based algorithms for boolean function manipulation. IEEE Trans. Comput. 35, 8, 677-691.
22. CHANG, B.-Y. E. AND LEINO,K. R.M. 2005. Abstract interpretation with alien expressions and heap structures. In Proceedings of the 6th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'05). R. Cousot, Ed. Lecture Notes in Computer Science, vol.3385. Springer, 147-163.
23. CHOI, J. D., BURKE, M., AND CARINI, P. 1993. Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects. In Proceedings of the 20th Symposium on Principles of Programming Languages (POPL'93). ACM, 232-245.
24. CODISH, M. 2007. Proving termination with (boolean) satisfaction. In Proceedings of the 17th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR'07). A. King, Ed. Lecture Notes in Computer Science, vol.4915. 1-7.
25. CODISH, M., LAGOON, V., AND STUCKEY, P. J. 2005. Testing for termination with monotonicity constraints. In Proceedings of the 21st International Conference on Logic Programming (ICLP'05). M. Gabbrielli and G. Gupta, Eds. Lecture Notes in Computer Science, vol.3668. 326-340.
26. CODISH, M. AND TABOCH, C. 1999. A semantics basis for termination analysis of logic programs. J. Logic Program. 41, 1, 103-123.
27. COOK, B., PODELSKI, A., AND RYBALCHENKO, A. 2005. Abstraction refinement for termination. In Proceedings of the 12th Static Analysis Symposium (SAS'05). C. Hankin and I. Siveroni, Eds.
28. COOK, B., PODELSKI, A., AND RYBALCHENKO, A. 2006a. Termination proofs for systems code. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'06). M. I. Schwartzbach and T. Ball, Eds. ACM, 415-426.
29. COOK, B., PODELSKI, A., AND RYBALCHENKO, A. 2006b. Terminator: beyond safety. In Proceedings of the 18th International Conference on Computer Aided Verification (CAV'06). T. Ball and R. B. Jones, Eds. Lecture Notes in Computer Science, vol.4144. Springer, 415-418.
30. COOK, B., PODELSKI, A., AND RYBALCHENKO, A. 2007. Proving thread termination. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'07). J. Ferrante and K. S. McKinley, Eds. ACM, 320-330.
31. CORBETT, J. C., DWYER, M. B.,HATCLIFF, J., LAUBACH, S., PASAREANU, C. S.,ROBBY, AND ZHENG, H. 2000. Bandera: Extracting finite-state models from java source code. In Proceedings of the 22nd International Conference on Software Engineering (ICSE'00). ACM, 439-448.
32. COUSOT, P. 2005. Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming. In Proceedings of the 6th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'05). R. Cousot, Ed. Lecture Notes in Computer Science, vol.3385. Springer, 1-24.
33. COUSOT, P. AND COUSOT, R. 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'77). 238-252.
34. COUSOT, P. AND COUSOT, R. 1979. Systematic design of program analysis frameworks. In Proceedings of the 6th ACM Symposium on Principles of Programming Languages (POPL'79). ACM, 269-282.
35. COUSOT, P. AND HALBWACHS, N. 1978. Automatic discovery of linear restraints among variables of a program. In Proceedings of the 5th ACM Symposium on Principles of Programming Languages (POPL'78). ACM, 84-96.
36. DE SCHREYE, D. AND DECORTE, S. 1994. Termination of logic programs: The never-ending story. Journal of Logic Programming 19/20, 199-260.
37. DEAN, J., GROVE, D., AND CHAMBERS, C. 1995. Optimization of object-oriented programs using static class hierarchy analysis. In Proceedings of the 9th European Conference on Object-Oriented Programming (ECOOP'95).W. G. Olthoff, Ed. Lecture Notes in Computer Science, vol.952. Springer, 77-101.
38. DERSHOWITZ, N., LINDENSTRAUSS, N., SAGIV, Y., AND SEREBRENIK, A. 2001. A general framework for automatic termination analysis of logic programs. Appl. Algebra Engin. Comm. Comput. 12, 1-2, 117-156.
39. DISTEFANO, D., O'HEARN, P. W., AND YANG, H. 2006. A local shape analysis based on separation logic. In Proceedings of the 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'06). H. Hermanns and J. Palsberg, Eds. Lecture Notes in Computer Science, vol.3920. Springer, 287-302.
40. FLOYD, R. W. 1967. Assigning meanings to programs. In Mathematical Aspects of Computer Science, J. T. Schwartz, Ed. Proceedings of Symposia in Applied Mathematics, vol.19. American Mathematical Society, Providence, Rhode Island, 19-32.
41. GABBRIELLI, M. AND GIACOBAZZI, R. 1994. Goal independency and call patterns in the analysis of logic programs. In Proceedings of the ACM Symposium on Applied Computing (SAC'94). ACM, 394-399.
42. GENAIM, S. AND CODISH, M. 2005. Inferring termination conditions for logic programs using backwards analysis. Theory Prac. Logic Program. 5, 1-2, 75-91.
43. GENAIM, S. AND SPOTO, F. 2008. Constancy analysis. In Proceedings of the 10thWorkshop on Formal Techniques for Java-like Programs (FTfJP'08), M. Huisman, Ed.
44. GIESL, J., SCHNEIDER-KAMP, P., AND THIEMANN, R. 2006. Automatic termination proofs in the dependency pair framework. In Proceddings of the 3th International Joint Conference on Automated Reasoning (IJCAR'06). U. Furbach and N. Shankar, Eds. Lecture Notes in Computer Science, vol.4130. Springer, 281-286.
45. GOTSMAN, A., BERDINE, J., AND COOK, B. 2006. Interprocedural shape analysis with separated heap abstractions. In Proceedings of the 13th International Static Analysis Symposium (SAS'06). K. Yi, Ed. Lecture Notes in Computer Science, vol.4134. Springer, 240-260.
46. ISHTIAQ, S. S. AND O'HEARN, P.W. 2001. BI as an assertion language for mutable data structures. In Proceedings of the 28th Symposium on Principles of Programming Languages (POPL'01). ACM, 14-26.
47. JAFFAR, J. AND MAHER, M. J. 1994. Constraint logic programming: A survey. J. Logic Program. 19, 20, 503-581.
48. KLEIN, G. AND NIPKOW, T. 2006. A machine-checked model for a java-like language, virtual machine, and compiler. ACM Trans. Program. Lang. Syst. 28, 4, 619-695.
49. LEAVENS, G. T., LEINO, K. R. M., AND MÜLLER, P. 2007. Specification and verification challenges for sequential object-oriented programs. Formal Aspects Comput. 19, 2, 159-189.
50. LEE, C. S., JONES, N. D., AND BEN-AMRAM, A. M. 2001. The size-change principle for program termination. In Proceedings of the 28th Symposium on Principles of Programming Languages (POPL'01). ACM, 81-92.
51. LEHNER, H. ANDMÜLLER, P. 2007. Formal translation of bytecode into boogiePL. Electr. Not. Theor. Comput. Sci. 190, 1, 35-50.
52. LEINO, K. R. M. AND MÜLLER, P. 2004. Object invariants in dynamic contexts. In Proceedings of the 18th European Conference on Object-Oriented Programming (ECOOP'04). M. Odersky, Ed. Lecture Notes in Computer Science, vol.3086. Springer, 491-516.
53. LEINO, K. R. M. AND MÜLLER, P. 2005. Modular verification of static class invariants. In Proceedings of the International Symposium of Formal Methods Europe (FM'05). J. Fitzgerald, I. J.Hayes, and A. Tarlecki, Eds. Lecture Notes in Computer Science, vol.3582. Springer, 26-42.
54. LEINO, K. R. M. AND WALLENBURG, A. 2008. Class-local object invariants. In Proceedings of the 1st India Software Engineering Conference (ISEC'08). G. Schroff, P. Jalote, and S. K. Rajamani Eds., ACM, 57-66.
55. LINDENSTRAUSS, N., SAGIV, Y., AND SEREBRENIK, A. 1997. TermiLog: A system for checking termination of queries to logic programs. In Proceedings of the 9th International Conference on Computer Aided Verfication (CAV'97). O. Grumberg, Ed. Lecture Notes in Computer Science, vol.1254. Springer, 444-447.
56. LINDHOLM, T. AND YELLIN, F. 1999. The JavaTM Virtual Machine Specification, 2nd ed. Addison-Wesley.
57. LINDSTROM, G., MEHLITZ, P. C., AND VISSER, W. 2005. Model checking real time java using java Pathfinder. In Proceedings of the 3rd International Symposium on Automated Technology for Verification and Analysis (ATVA,05). D. Peled and Y.-K. Tsay, Eds. Lecture Notes in Computer Science, vol.3707. Springer, 444-456.
58. LOGINOV, A., REPS, T.W., AND SAGIV,M. 2006. Refinement-based verification for possibly-cyclic lists. In Proceedings of Theory and Practice of Program Analysis and Compilation, Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday, T. W. Reps, M. Sagiv, and J. Bauer, Eds. Lecture Notes in Computer Science, vol.4444. Springer, 247-272.
59. LOGOZZO, F. AND FÄHNDRICH, M. 2008. On the relative completeness of bytecode analysis versus source code analysis. In Proceedings of the 17th International Conference on Compiler Construction (CC'08). L. Hendren, Ed. Lecture Notes in Computer Science. Springer, 197-212.
60. MANOLIOS, P. AND VROON, D. 2006a. Integrating static analysis and general-purpose theorem proving for termination analysis. In Proceedings of the 28th International Conference on Software Engineering (ICSE'06). L. J. Osterweil, H. D. Rombach, and M. L. Soffa, Eds. ACM, 873-876.
61. MANOLIOS, P. AND VROON, D. 2006b. Termination analysis with calling context graphs. In Proceedings of the 18th International Conference on Computer Aided Verification (CAV'06). T. Ball and R. B. Jones, Eds. Lecture Notes in Computer Science, vol.4144. Springer, 401-414.
62. MANSON, J. AND PUGH,W. 2001. Core semantics of multithreaded java. In Proceedings of the ACM Java Grande Conference. ACM, 29-38.
63. MANSON, J., PUGH, W., AND ADVE, S. V. 2005. The java memory model. In Proceedings of the 32nd ACMSIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'05). J. Palsberg and M. Abadi, Eds. ACM, 378-391.
64. MESNARD, F. 1996. Inferring left-terminating classes of queries for constraint logic programs. In Proceedings of the Joint International Conference and Symposium on Logic Programming, M. Maher, Ed. The MIT Press, 7-21.
65. MESNARD, F. AND BAGNARA, R. 2005. cTI: A constraint-based termination inference tool for ISOProlog. Theory Pract. Logic Program. 5, 1-2, 243-257.
66. MESNARD, F. AND SEREBRENIK, A. 2008. Recurrence with affine level mappings is p-time decidable for CLP(R). Theory Pract. Logic Program. 8, 1, 111-119.
67. MINÉ, A. 2006. The octagon abstract domain. Higher-Order Symb. Comput. 19, 1, 31-100.
68. MONNIAUX, D. 2008. The pitfalls of verifying floating-point computations. ACM Trans. Program. Lang. Syst. 30, 3.
69. MÜLLER, P. 2007. Reasoning about object structures using ownership. In Proceedings of theWorkshop on Verified Software: Theories, Tools, Experiments (VSTTE'07). B. Meyer and J. Woodcock, Eds. Lecture Notes in Computer Science, vol.4171. Springer.
70. NYUGEN, M. T. AND DE SCHREYE, D. 2005. Polynomial interpretations as a basis for termination analysis of logic programs. In Proceedings of the 21st International Conference on Logic Programming (ICLP'05). M. Gabbrielli and G. Gupta, Eds. Lecture Notes in Computer Science, vol.3668. Springer, 311-326.
71. OHLEBUSCH, E., CLAVES, C., AND MARCHÉ, C. 2000. TALP: A tool for the termination analysis of logic programs. Proceedings of the 11th International Conference on Rewriting Techniques and Applications (RTA'00). L. Bachmair, Ed. Lecture Notes in Computer Science, vol.1833. Springer, 270-273.
72. PALSBERG, J. AND SCHWARTZBACH, M. I. 1991. Object-Oriented type inference. In Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA' 91). A. Paepcke, Ed. ACM SIGPLAN Not., 26, 11 ACM, 146-161.
73. PAYET, E. AND SPOTO, F. 2007. Magic-sets transformation for the analysis of java bytecode. In Proceedings of the 14th International Static Analysis Symposium (SAS'07). H. R. Nielson and G. FilÉ, Eds. Lecture Notes in Computer Science, vol.4634. Springer, 452-467.
74. PIPPENGER, N. 1997. Pure versus impure lisp. ACM Trans. Program. Lang. Syst. 19, 2, 223-238.
75. PL ÜMER, L. 1990. Termination proofs for logic programs. Lecture Notes in Computer Science, vol.446. Springer.
76. PODELSKI, A. AND RYBALCHENKO, A. 2004a. A complete method for synthesis of linear ranking functions. In Proceedings of the 5th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'04). B. Steffen and G. Levi, Eds. Lecture Notes in Computer Science, vol.2937. Springer, 239-251.
77. PODELSKI, A. AND RYBALCHENKO, A. 2004b. Transition invariants. In Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS'04). H. Ganzinger, Ed. IEEE, 32-41.
78. PODELSKI, A. AND RYBALCHENKO, A. 2007. Transition predicate abstraction and fair termination. ACM Trans. Program. Lang. Syst. 29, 3.
79. POLLET, I., LE CHARLIER, B., AND CORTESI, A. 2001. Distinctness and sharing domains for static analysis of java programs. In Proceedings of the 15th European Conference on Object-Oriented Programming (ECOOP'01). Lecture Notes in Computer Science, vol.2072. 77-98.
80. REYNOLDS, J. C. 2000. Intuitionistic reasoning about shared mutable data structure. In Proceedings of Millennial Perspectives in Computer Science, Symposium in Honour of Sir Tony Hoare, J. Davies, B. Roscoe, and J. Woodcock, Eds. 303-321.
81. ROSSIGNOLI, S. AND SPOTO, F. 2006. Detecting non-cyclicity by abstract compilation into boolean functions. In Proceedings of the 7th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'06). E. A. Emerson and K. S. Namjoshi, Eds. Lecture Notes in Computer Science, vol.3855. Springer, 95-110.
82. SALCIANU, A. AND RINARD, M. C. 2005. Purity and side effect analysis for java programs. In Proceedings of the 6th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'05). R. Cousot. Ed. Lecture Notes in Computer Science, vol.3385. Springer, 199-215.
83. SCHNEIDER-KAMP, P., GIESL, J., SEREBRENIK, A., AND THIEMANN, R. 2006. Automated termination analysis for logic programs by term rewriting. In Proceedings of the 16th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR'06). G. Puebla. Ed. Lecture Notes in Computer Science, vol.4407. Springer, 177-193.
84. SECCI, S. AND SPOTO, F. 2005. Pair-sharing analysis of object-oriented programs. In Proceedings of Static Analysis Symposium (SAS'05). C. Hankin and I. Siveroni, Eds. Lecture Notes in Computer Science, vol.3672. 320-335.
85. SEREBRENIK, A. AND DE SCHREYE, D. 2002. On termination of logic programs with floating point computations. In Proceedings of the 9th International Symposium on Static Analysis (SAS'02). M. V. Hermenegildo and G. Puebla, Eds. Lecture Notes in Computer Science, vol.2477. Springer, 151-164.
86. SPOTO, F. 2008a. The JULIA static analyser. http://profs.sci.univr.it/? spoto/julia.
87. SPOTO, F. 2008b. Nullness analysis in boolean form. In Proceedings of the 6th IEEE International Conference on Software Engineering and Formal Methods (SEFM'08). A. Cerone and S. Goner Eds. IEEE Computer Society, 21-30.
88. SPOTO, F., HILL, P. M., AND PAYET, E. 2006. Path-Length analysis for object-oriented programs. In International Workshop on Emerging Applications of Abstract Interpretation (EAAI'06). http://profs.sci.univr.it/?spoto/papers.html.
89. SPOTO, F. AND JENSEN, T. 2003. Class analyses as abstract interpretations of trace semantics. ACM Trans. Programm. Lang. Syst. 25, 5, 578-630.
90. SPOTO, F., MESNARD, F., AND PAYET, E. 2008. Julia + BinTerm: An automatic termination prover for Java bytecode. http://spy.sci.univr.it/JuliaWeb.
91. SPOTO, F., LU, L., AND MESNARD, F. 2009. Using CLP simplifications to improve Java bytecode termination analysis. Electr. Notes Theor. Comput. Sci. 253, 5, 129-144.
92. STEENSGAARD, B. 1996. Points-to analysis in almost linear time. In Proceedings of the 23th ACM Symposium on Principles of Programming Languages (POPL'96). 32-41.
93. STOER, J. AND WITZGALL, C. 1970. Convexity and Optimization in Finite Dimensions I. Springer.
94. SUWIMONTEERABUTH, D., BERGER, F., SCHWOON, S., AND ESPARZA, J. 2007. jMoped: A test environment for java programs. In Proceedings of the 19th International Conference on Computer Aided Verification (CAV'07).W. Damm and H. Hermanns, Eds. Lecture Notes in Computer Science, vol.4590. Springer, 164-167.
95. SUWIMONTEERABUTH, D., SCHWOON, S., AND ESPARZA, J. 2005. jMoped: A java bytecode checker based on moped. In Proceedings of the 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'05). N. Halbwachs and L. D. Zuck, Eds. Lecture Notes in Computer Science, vol.3440. Springer, 541-545.
96. TABOCH, C., GENAIM, S., AND CODISH,M. TerminWeb: Semantic based termination analyser for logic programs. http://www.cs.bgu.ac.il/?mcodish/ TerminWeb.
97. TARSKI, A. 1955. A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math 5, 285-309.
98. TURING, A. 1936. On computable numbers, with an application to the entscheidungsproblem. London Math. Soc. 42, 2, 230-265.
99. ULLMAN, J. D. AND GELDER, A. V. 1988. Efficient tests for top-down termination of logical rules. J. ACM 35, 2, 345-373.
100. VISSER, W., HAVELUND, K., BRAT, G. P., PARK, S., AND LERDA, F. 2003. Model checking programs. Autom. Softw. Engin. 10, 2, 203-232.
101. WILDMOSER, M., CHAIEB, A., AND NIPKOW, T. 2005. Bytecode analysis for proof carrying code. Electr. Not. Theore. Comput. Sci. 141, 1, 19-34.
102. WILDMOSER, M. AND NIPKOW, T. 2005. Asserting bytecode safety. In Proceedings of the 14th European Symposium on Programming (ESOP'05). S. Sagiv, Ed. Lecture Notes in Computer Science, vol.3444. Springer, 326-341.
103. WILHELM, R., REPS, T. W., AND SAGIV, S. 2002. Shape analysis and applications. In The Compiler Design Handbook, Y. N. Srikant and P. Shankar, Eds. 175-218.