Program termination analysis in polynomial time

ACM Transactions on Programming Languages and Systems

Volumn 29, Issue 1, 2007, Pages

  Ben Amram, Amir M ^a   Lee, Chin Soon ^b  

^a ACADEMIC COLLEGE OF TEL AVIV YAFFO   (Israel)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Abstraction; Program analysis; Size change graph; Size change termination; Termination analysis

Indexed keywords

PROGRAM ANALYSIS; SIZE-CHANGE GRAPH; SIZE-CHANGE TERMINATION; TERMINATION ANALYSIS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; INFORMATION RETRIEVAL;

ABSTRACTING;

EID: 33846634514     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1180475.1180480     Document Type: Article

References (36)

1. ANDERSON, H. AND KHOO, S. C. 2003. Affine-Based size-change termination. In Proceedings of the 1st Asian Symposium on Programming Languages and Systems (APLAS), A. Ohori, Ed. Lecture Notes in Computer Science, vol. 2895. Springer Verlag, 122-140.
2. ANDERSON, H. AND KHOO, S. C. 2005. Bounded size-change termination. Tech. Rep. TRB6/05, National University of Singapore, Singapore.
3. APT, K. R. AND PEDRESCHI, D. 1994. Modular termination proofs for logic and pure Prolog programs. In Advances in Logic Programming Theory. Oxford University Press, 183-229.
4. ARTS, T. 2001. Automatically proving termination and innermost normalisation of term rewriting systems. Ph.D. thesis, Universiteit Utrecht, The Netherlands.
5. AVERY, J. 2005. The size-change termination principle on non well founded data types. Tech. Rep., Datalogisk Institut Københavns Universitet, Denmark.
6. BEN-AMRAM, A. 2002. General size-change termination and lexicographic descent. In The Essence of Computation: Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones, T. Mogensen et al. Eds. Lecture Notes in Computer Science, vol. 2566. Springer Verlag, 3-17.
7. BUENO, F., GARCÍA DE LA BANDA, M., AND HERMENEGILDO, M. 1994. Effectiveness of global analysis in strict independence-based automatic program parallelization. In Proceedings of the International Logic Programming Symposium (ILPS). MIT Press, Cambridge, MA. 320-336.
8. CODISH, M., LAGOON, V., AND STUCKEY, P. 2005. Testing for termination with monotonicity constraints. In Proceedings of the 21st International Conference on Logic Programming (ICLP). To appear.
9. CODISH, M., MARIOTT, K., AND TABOCH, C. 2000. Improving program analyses by structure untupling. J. Logic Program. 43, 3, 251-263.
10. CODISH, M. AND TABOCH, C. 1997. A semantic basis for termination analysis of logic programs and its realization using symbolic norm constraints. In Proceedings of the 6th International Conference on Algebraic and Logic Programming (ALP), M. Hanus et al., Eds. Lecture Notes in Computer Science, vol. 1298. Springer Verlag, 31-45.
11. CORMEN, T. H., LEISERSON, C. E., AND RIVEST, R. L. 2001. Introduction to Algorithms. MIT Press Cambridge, MA.
12. DERSHOWITZ, N. AND MANNA, Z. 1979. Proving termination with multiset orderings. Commun. ACM 22, 8 (Aug.), 465-476.
13. DE SCHREYE, D. AND DECORTE, S. 1994. Termination of logic programs: The never-ending story. J. Logic Program. 19-20, 199-260.
14. FLOYD, R. W. 1967. Assigning meanings to programs. Proceedings of Symposia in Applied Mathematics XIX, 19-32.
15. FREDERIKSEN, C. C. 2001. A simple implementation of the size-change principle. Tech. Rep. D-442, Datalogisk Institut Københavns Universitet, Denmark.
16. GENAIM, S. AND CODISH, M. 2002. Combining norms to prove termination. In Proceedings of the International Workshop on Verification, Model Checking and Abstract Interpretation (VMCAI). Springer Verlag.
17. GIESL, J., THIEMANN, R., SCHNEIDER-K AMP, P., AND FALKE, S. 2004. Automated termination proofs with AProVE. In Proceedings of the 15th International Conference on Rewriting Techniques and Applications (RTA). Lecture Notes in Computer Science, vol. 3091. Springer Verlag, 210-220.
18. GLENSTRUP, A. AND JONES, N. 2004. Termination analysis and specialization-point insertion in offline partial evaluation. Tech. Rep. D-498, Datalogisk Institut Københavns Universitet, Denmark.
19. JONES, N. D. AND BOHR, N. 2004. Termination analysis of the untyped lambda calculus. In Proceedings of the 15th International Conference on Rewriting Techniques and Applications (RTA). Lecture Notes in Computer Science, vol. 3091. Springer Verlag, 1-23.
20. LEE, C. S. 1999. Partial evaluation of the Euclidean algorithm, revisited. Higher-Order Symb. Comput. 12, 2 (Sept.), 203-212.
21. LEE, C. S. 2001. Program termination analysis and termination of offline partial evaluation. Ph.D. thesis, UWA, Australia.
22. LEE, C. S., JONES, N. D., AND BEN-A MRAM, A. 2001. The size-change principle for program termination. In Proceedings of the 28th ACM Symposium on Principles of Programming Languages (POPL).
23. LEE, C. S. 2002. Program termination analysis in polynomial time. In Proceedings of the 1st International Conference on Generative Programming and Component Engineering (GPCE). Lecture Notes in Computer Science, vol. 2487. Sringer Verlag, 218-235.
24. LINDENSTRAUSS, N. AND SAGIV, Y. 1997a. Automatic termination analysis of logic programs (with detailed experimental results), http://www.cs.huji.ac.il/~naomil/.
25. LINDENSTRAUSS, N. AND SAGIV, Y. 1997b. Automatic termination analysis of Prolog programs. In Proceedings of the 14th International Conference on Logic Programming (ICLP), L. Naish, Ed. MIT Press, Cambridge, MA. 64-77.
26. PAIGE, R. AND YANG, Z. 1997. High level reading and structure compilation. In Proceedings of the 24th ACM Symposium on Principles of Programming Languages (POPL). 456-469.
27. PÉTER, R. 1967. Recursive Functions. Academic Press.
28. PLÜMER, L. 1990. Termination Proofs for Logic Programs. Lecture Notes in Artificial Intelligence, vol. 446. Springer Verlag.
29. PODELSKI, A. AND RYBALCHENKO, A. 2005. Transition predicate abstraction and fair termination. In Proceedings of the 32nd ACM Symposium on Principles of Programming Languages (POPL).
30. SAGIV, Y. 1991. A termination test for logic programs. In Proceedings of the International Logic Programming Symposium (ILPS), V. Saraswat and K. Ueda, Eds. MIT Press, Cambridge, MA. 518-532.
31. THIEMANN, R. AND GIESL, J. 2003. Size-Change termination for term rewriting. In Proceedings of the 14th International Conference on Rewriting Techniques and Applications (RTA). Lecture Notes in Computer Science, vol. 2706. Springer Verlag, 264-278.
32. THIEMANN, R. AND GIESL, J. 2005. The size-change principle and dependency pairs for termination of term rewriting. In Applicable Algebra in Engineering, Communication and Computing. To appear, doi 10.1007/s00200-005-0179-7.
33. TURING, A. M. 1948. Checking a large routine. In Report of a Conference on High Speed Automatic Calculating Machines. 67-69.
34. Reprinted in The Early British Computer Conferences, vol. 14 of Charles Babbage Institute Reprint Series For The History Of Computing, MIT Press, Cambridge, MA. 1989.
35. WAHLSTEDT, D. 2000. Detecting termination using size-change in parameter values. Master's thesis, Göteborgs Universitet, Sweden.
36. XI, H. 1999. Dependent types for program termination verification. Higher-Order Symb. Comput. 15, 1 (Mar.), 91-131.