Size-change termination with difference constraints

ACM Transactions on Programming Languages and Systems

Volumn 30, Issue 3, 2008, Pages

  Ben Amram, Amir M ^a  

^a ACADEMIC COLLEGE OF TEL AVIV YAFFO   (Israel)

Author keywords

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

Indexed keywords

ABSTRACTING; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GRAPH THEORY; PROBLEM SOLVING; VERIFICATION;

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

COMPUTER SOFTWARE;

EID: 44249110961     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1353445.1353450     Document Type: Article

References (35)

1. ANDERSON, H. AND KHOO, S.-C. 2003. Affine-based size-change termination. In Proceedings of the First Asian Symposium on Programming Languages and Systems (APLAS 2003) (Beijing, China), A. Ohori, Ed. Lecture Notes in Computer Science, vol. 2895. Springer-Verlag, New York, 122-140.
2. 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, Oxford, UK, 183-229.
3. AVERY, J. 2006. Size-change termination and bound analysis. In Proceedings of the 8th International Symposium on Functional and Logic Programming (FLOPS 2006) M. Hagiya and 4 P. Wadler, Eds. Lecture Notes in Computer Science, vol. 3945. Springer-Verlag, New York.
4. BEN-AMRAM, A. M. AND LEE, C. S. 2007. Size-change analysis in polynomial time. ACM Trans. Prog. Lang. Syst. 29, 1.
5. BRODSKY, A. AND SAGIV, Y. 1991. Inference of inequality constraints in logic programs. In Proceedings of the 10th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS). ACM, New York, 227-240.
6. 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 Symposium on Logic Programming. MIT Press, Cambridge, MA, 320-336.
7. CODISH, M., LAGOON, V., AND STUCKEY, P. J. 2005. Testing for termination with monotonicity constraints. In Logic Programming, 21st International Conference, ICLP 2005, M. Gabbrielli and G. Gupta, Eds. Lecture Notes in Computer Science, vol. 3668. Springer-Verlag, New York, 326-340.
8. CODISH, M. AND TABOCH, C. 1999. A semantic basis for termination analysis of logic programs. The Journal of Logic Programming 41, 1, 103-123. (Preliminary (conference) version in LNCS 1298 (1997)).
9. COLÓN, M. AND SIPMA, H. 2002. Practical methods for proving program termination. In Proceedings of the 14th International Conference on Computer Aided Verification (CAV). Lecture Notes in Computer Science, vol. 2404. Springer-Verlag, New York, 442-454.
10. COOK, B., PODELSKI, A., AND RYBALCHENKO, A. 2005. Abstraction refinement for termination. In Proceedings of the 12th International Symposium on Static Analysis (SAS'05) (London, UK, Sept. 7-9) Lecture Notes in Computer Science, vol. 3672. Springer-Verlag, New York, 87-101.
11. COOK, B., PODELSKI, A., AND RYBALCHENKO, A. 2006. Terminator: Beyond safety. In Proceedings of the 18th International Conference on Computer Aided Verification (CAV 2006), (Seattle, WA, Aug.), T. Ball and R. B. Jones, Eds. Lecture Notes in Computer Science, vol. 4144. Springer-Verlag, New York, 415-418.
12. DERSHOWITZ, N., LINDENSTRAUSS, N., SAGIV, Y., AND SEREBRENIK, A. 2001. A general framework for automatic termination analysis of logic programs. Applic. Algebra Eng. Commun. Comput. 12, 1-2, 117-156.
13. DOWNEY, R. G. AND FELLOWS, M. R. 1995. Fixed-parameter tractability and completeness. I. basic results. SIAM J. Comput. 24, 4 (Aug.), 873-921.
14. GRAHAM, R. L. 1981. Rudiments of Ramsey Theory. American Mathematical Society.
15. JONES, N. D. 1988. Automatic program specialization: A re-examination from basic principles. In Partial Evaluation and Mixed Computation, D. Bjørner, A. P. Ershov, and N. D. Jones, Eds. North-Holland, Amsterdam, The Netherlands, 225-282.
16. JONES, N. D. 1997. Computability and Complexity from a Programming Perspective. Foundations of Computing Series. MIT Press, Cambridge, MA.
17. 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'04). Lecture Notes in Computer Science, vol. 3091. Springer-Verlag, New York, 1-23.
18. JONES, N. D., GOMARD, C. K., AND SESTOFT, P. 1993. Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs, NJ.
19. JONES, N. D., LANDWEBER, L. H., AND LIEN, Y. E. 1977. Complexity of some problems in Petri nets. Theoret. Comput. Sci. 4, 3 (June), 277-299.
20. LEE, C. S. 2002. Program termination analysis and termination of offline partial evaluation. Ph.D. dissertation, University of Western Australia.
21. LEE, C. S. 2008. Ranking functions for size-change termination. Submitted for publication in ACM Trans. Prog. Lang. Syst. (Levven, Belgium).
22. LEE, C. S., JONES, N. D., AND BEN-AMRAM, A. M. 2001. The size-change principle for program termination. In Proceedings of the 28th ACM Symposium on Principles of Programming Languages. ACM, New York, 81-92.
23. LINDENSTRAUSS, N. AND SAGIV, Y. 1997a. Automatic termination analysis of logic programs (with detailed experimental results). http://www.cs.huji.ac.il/∼naomil/.
24. LINDENSTRAUSS, N. AND SAGIV, Y. 1997b. Automatic termination analysis of Prolog programs. In Proceedings of the 14th International Conference on Logic Programming (Leuven, Belgium). L. Naish, Ed. MIT Press, Cambridge, MA, 64-77.
25. MANOLIOS, P. AND VROON, D. 2006. Termination analysis with calling context graphs. In Proceedings of the 18th International Conference on Computer Aided Verification (CAV 2006) (Seattle, WA Aug.). Lecture Notes in Computer Science, vol. 4144. Springer-Verlag, New York, 401-414.
26. NAISH, L. 1985. Automating control for logic programs. J. Logic Prog. 2, 3 (Oct.), 167-183.
27. PAPADIMITRIOU, C. H. 1981. On the complexity of integer programming. J. ACM 28 , 4, 765-768.
28. PLÜMER, L. 1990. Termination Proofs for Logic Programs. Lecture Notes in Artificial Intelligence, vol. 446. Springer-Verlag, New York.
29. PODELSKI, A. AND RYBALCHENKO, A. 2004. Transition invariants. In Proceedings of the Symposium on Logic in Computer Science (LICS'04). H. Ganzinger, Ed. IEEE Computer Society Press, Los Alamitos, CA, 32-41.
30. RAMSEY, F. P. 1930. On a problem of formal logic. In Proceedings of the London Mathematical Society. The London Mathematical Society, London, UK, 264-286.
31. SAGIV, Y. 1991. A termination test for logic programs. In Proceedings of the International Symposium on Logic Programming (San Diego, CA). V. Saraswat and K. Ueda, Eds. MIT Press, Cambridge, MA, 518-532.
32. SCHREYE, D. D. AND DECORTE, S. 1994. Termination of logic programs: The never-ending story. J. Logic Prog. 19-20, 199-260.
33. SOHN, K. AND VAN GELDER, A. 1991. Termination detectionin logic programs using argument sizes (extended abstract). In Proceedings of the 10th ACM SIGACT-SIGMOD-SOGART Symposium on Principles of Database Systems (PODS) (Denver, CO, May). ACM, New York, 216-226.
34. THIEMANN, R. AND GIESL, J. 2005. The size-change principle and dependency pairs for termination of term rewriting. Applic. Algebra Eng. Commun. Comput. 16, 4 (Sept.), 229-270.
35. ULLMAN G. D. AND GELDER, V. 1988. Efficient tests for top-down termination of logical rules. J. ACM 35, 2, 345-373.