Termination analysis of logic programs through combination of type-based norms

ACM Transactions on Programming Languages and Systems

Volumn 29, Issue 2, 2007, Pages

  Bruynooghe, Maurice ^a   Codish, Michael ^b   Gallagher, John P ^c   Genaim, Samir ^d,f   Vanhoof, Wim ^e  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^c ROSKILDE UNIVERSITY   (Denmark)

^d UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

^e UNIVERSITY OF NAMUR   (Belgium)

^f UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

Author keywords

Abstract interpretation; Dataflow analysis; Global analysis; Groundness analysis; Program analysis; Termination analysis

Indexed keywords

AUTOMATION; DATA FLOW ANALYSIS; GLOBAL OPTIMIZATION; SEMANTICS;

ABSTRACT INTERPRETATION; GLOBAL ANALYSIS; GROUNDNESS ANALYSIS; PROGRAM ANALYSIS; TERMINATION ANALYSIS;

LOGIC PROGRAMMING;

EID: 34247228022     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1216374.1216378     Document Type: Article

References (52)

1. APT, K. R. 1990. Introduction to logic programming. In Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics, J. van Leeuwen, ed. Elsevier, Amsterdam, and MIT Press, Cambridge, MA. 495-574.
2. APT, K. R. 1997. From Logic Programming to Prolog. Prentice Hall.
3. APT, K. R. AND PEDRESCHI, D. 1993. Reasoning about termination of pure Prolog programs. Inf. Camput. 106, 1 (Sept.), 109-157.
4. BENOY, F. AND KING, A. 1996. Inferring argument size relationships with CLP(R). In Proceedings of the 6th International Workshop on Logic Program Synthesis and Transformation (LOPSTR). 204-223.
5. BOSSI, A., COCCO, N., ETALLE, S., AND ROSSI, S. 2002. On modular termination proofs of general logic programs. Theory Pract. Logic Program. 2, 3, 263-291.
6. BOSSI, A., COCCO, N., AND FABRIS, M. 1991. Proving termination of logic programs by exploiting term properties. In Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT), vol. 2. S. Abramsky and T. Maibaum Eds. Lecture Notes in Computer Science, vol. 494. Springer Verlag, Berlin. 153-180.
7. BOSSI, A., COCCO, N., AND FABRIS, M. 1992. Typed norms. In Proceeedings of the 4th European Symposium on Programming (ESOP), B. Krieg-Brückner, ed. Lecture Notes in Computer Science, vol. 582. Springer Verlag, Berlin. 73-92.
8. BRODSKY, A. AND SAGIV, Y. 1989. Inference of monotonicity constraints in Datalog programs. In Proceedings of the 8th ACM SIGACT-SIGART-SIGMOD Symposium on Principles of Database Systems. 190-199.
9. BRUYNOOGHE, M., CODISH, M., GENAIM, S., AND VANHOOF, W. 2002. Reuse of results in termination analysis of typed logic programs. In Proceedings of the 9th International Static Analysis Symposium, M. Hermenegildo and G. Puebla, eds. Lecture Notes in Computer Science, vol. 2477. Springer Verlag. 477-492.
10. BRUYNOOGHE, M., CODISH, M., GENAIM, S., AND VANHOOF, W. 2003. A note on the reuse of the results of a termination analysis based on polymorphic types. Tech. Rep., Katholieke Universiteit Leuven, Department of Computer Science. Rep. CW 383. http://www.cs.kuleuven.ac.be/publicaties/rapporten/cw/CW383.abs.html.
11. BRUYNOOGHE, M., GALLAGHER, J. P., AND VAN HUMBEECK, W. 2005. Inference of well-typings for logic programs with application to termination analysis. In Proceedings of the 12th International Static Analysis Symposium (SAS). C. Hankin and I. Siveroni Eds. Lecture Notes in Computer Science, vol. 3672, Springer Verlag, 35-51.
12. BRUYNOOGHE, M., VANHOOF, W., AND CODISH, M. 2001. Pos(T): Analyzing dependencies in typed logic programs. In Proceedings of the Perspectives of System Informatics, 4th International Andrei Ershov Memorial Conference, (PSI). Lecture Notes in Computer Science, vol. 2244. Springer Verlag. 406-420.
13. CODISH, M. AND GENAIM, S. 2003. Proving termination one loop at time. In Proceedings of the 13th International Workshop on Logic Programming Environments, F. Mesnard and A. Serebrenik, eds. http://www.cs.kuleuven.ac.be/publicaties/rapporten/cw/CW371.abs.html.
14. CODISH, M., GENAIM, S., BRUYNOOGHE, M., GALLAGHER, J., AND VANHOOF, W. 2003. One loop at a time. In 6th International Workshop on Termination. http://www.dsic.upv. es/rdp03/wst/proceedings.html.
15. CODISH, M. AND TABOCH, C. 1999. A semantic basis for the termination analysis of logic programs. J. Logic Program. 41, 1, 103-123.
16. COUSOT, P. AND HALBWACHS, N. 1978. Automatic discovery of linear restraints among variables of a program. In Proceedings of the 5th Annual ACM Symposium on Principles of Programming Languages. 84-96.
17. DE SCHREYE, D. AND VERSCHAETSE, K. 1995. Deriving linear size relations for logic programs by abstract interpretation. New Gen. Comput. 13, 2, 117-154.
18. DE SCHREYE, D., VERSCHAETSE, K., AND BRUYNOOGHE, M. 1992. A framework for analyzing the termination of definite logic programs with respect to call patterns. In Proceedings of the International Conference on 5th Generation Computer Systems (Japan). 481-488.
19. DECORTE, S., DE SCHREYE, D., AND FABRIS, M. 1993. Automatic inference of norms: A missing link in automatic termination analysis. In Logic Programming Proceedings of the International Symposium (Vancouver, Canada), D. Miller, ed. MIT Press (Cambridge, MA.) 420-436.
20. DECORTE, S., DE SCHREYE, D., AND FABRIS, M. 1996. Integrating types in termination analysis. Tech. Rep. CW 222, K.U. Leuven, Department of Computer Science.
21. DECORTE, S., DE SCHREYE, D., AND FABRIS, M. 1997. Exploiting the power of typed norms in automatic inference of interargument relations. Tech. Rep. CW 246, K.U. Leuven, Department of Computer Science.
22. DERSHOWITZ, N. 1995. 33 examples of termination. In French Spring School of Theoretical Computer Science Advanced Course on Term Rewriting (Font Romeux, France, May), H. Comon and J.-P. Jouannaud, eds. Lecture Notes in Computer Science, vol. 909. Springer Verlag. 16-26.
23. DERSHOWITZ, N., LINDENSTRAUSS, N., SAGIV, Y., AND SEREBRENIK, A. 2001. A general framework for automatic termination analysis of logic programs. App. Algebra Eng, Commun. Comput. 12, 1-2, 117-156.
24. DERSHOWITZ, N. AND MANNA, Z. 1979. Proving termination with multiset orderings. Commun. ACM 22, 465-476.
25. GABBRIELLI, M. AND GIACOBAZZI, R. 1994. Goal independency and call patterns in the analysis of logic programs. In Proceedings of the 9th ACM Symposium on Applied Computing. ACM Press, New York, 394-399.
26. GALLAGHER, J. AND PUEBLA, G. 2002. Abstract interpretation over non-deterministic finite tree automata for set-based analysis of logic programs. In Proceedings of the Practical Aspects of Declarative Languages, 4th International Symposium (Portland, OR, Jan. 19-20), S. Krishnamurthi and C. R. Ramakrishnan, eds. Lecture Notes in Computer Science, vol. 2257. Springer, Verlag. 243-261.
27. GALLAGHER, J. P. AND DE WAAL, D. A. 1994. Fast and precise regular approximations of logic programs. In Proceedings of the 11th International Conference on Logic Programming (Santa Margherita Ligure, Italy), P. Van Hentenryck, ed. MIT Press, Cambridge, MA. 599-613.
28. GENAIM, S. AND CODISH, M. 2005. Inferring termination conditions for logic programs using backwards analysis. Theory Pract. Logic Program, 5, 1-2, 75-91.
29. GENAIM, S., CODISH, M., GALLAGHEH, J., AND LAGOON, V. 2002. Combining norms to prove termination. In Proceedings of the 3rd International Workshop on Verification, Model Checking and Abstract Interpretation, A. Cortesi, ed. Lecture Notes in Computer Science, vol. 2294. Springer Verlag. 126-138.
30. GRAHAM, R. L., ROTHSCHILD, B. L., AND SPENCER, J. H. 1980. Ramsey Theory. Wiley-Interscience Series in Discrete Mathematics. John Wiley, New York.
31. HILL, P. M. AND TOPOR, R. W. 1992. A semantics for typed logic programs. In Types in Logic Programming, F. Pfenning, ed. MIT Press, Cambridge, MA.
32. KARR, M. 1976. Affine relationships among variables of a program. Acta Inf. 6, 133-151.
33. KING, A., SHEN, K., AND BENDY, F. 1997. Lower-Bound time-complexity analysis of logic programs. In Proceedings of the International Symposium on Logic Programming, J. Maluszynski, ed. MIT Press, Cambridge, MA. 261-276.
34. LAGOON, V. 2004. Analysis of typed logic programs. Ph.D. thesis, the University of Melbourne, Australia.
35. LAGOON, V., MESNARD, F., AND STUCKEY, P. 2003. Termination analysis with types is more accurate. In Proceedings of the 19th International Conference on Logic Programming, C. Palamidessi, ed. Lecture Notes in Computer Science, vol. 2916. Springer Verlag. 254-268.
36. LAGOON, V. AND STUCKEY, P. 2001. Aframework for analysis of typed logic programs, In. Proceedings of the rth International Symposium on Functional and Logic Programming (FLOPS). Lecture Notes in Computer Science, vol. 2024. Springer Verlag. 296-310.
37. LEE, C. S. 2002. Program termination analysis and termination of offline partial evaluation. Ph.D. thesis, University of Western Australia.
38. LEE, C. S., JONES, N. D., AND BEN-AMRAM, A. M. 2001. The size-change principle for program termination. ACM SIGPLAN Not. 36, 3, 81-92. In Proceedings of the Symposium on Principles of Programming Languages (POPL).
39. LINDENSTRAUSS, N. AND SAGIV, Y. 1997. Automatic termination analysis of logic programs. In Proceedings of the 14th International Conference on Logic Programming (Leuven, Belgium), L. Naish, ed. MIT Press, Cambridge, MA. 63-77.
40. nd ed. Springer-Verlag, Berlin.
41. MARRIOTT, K. AND SøNDEHGAARD, H. 1993. Precise and efficient groundness analysis for logic programs. ACM Lett. Program. Lang. Syst. 2, 1-4, 181-196.
42. MARTIN, J., KING, A., AND SOPEH, P. 1996. Typed norms for typed logic programs. In Logic Programming Synthesis and Transformation, 6th International Workshop (LOPSTR), J. P. Gallagher, ed. Lecture Notes in Computer Science, vol. 1207. Springer Verlag, 224-238.
43. MESNAHD, F. 1996. Inferring left-terminating classes of queries for constraint logic programs. In Proceedings of the Joint International Conference and Syposium on Logic Programming (Bonn, Germany), M. J. Maher, ed. MIT Press, Cambridge, MA. 7-21.
44. MESNARD, F. AND NEUMERKEL, U. 2001. Applying static analysis techniques for inferring termination conditions of logic programs. In Static Analysis, 8th International Symposium, P. Cousot, ed. Lecture Notes in Computer Science, vol. Springer Verlag. 2126. 93-110.
45. MYCROFT, A. AND O'KEEFE., R. 1984. A polymorphic type system for Prolog. Artif. Intell. 23, 3, 295-307.
46. RAMSEY, F. 1930. On a problem of formal logic. In Proceedings of the London Mathematical Society, vol. 30. 264-286.
47. SEREBRENIK, A. AND DE SCHREYE, D. 2001. Non-Transformational termination analysis of logic programs, based on general term-orderings. In Logic Based Program Synthesis and Transformation, 10th International Workshop (LOPSTR). (London, UK, Jul. 24-28), K.-K. Lau, ed. Lecture Notes in Computer Science, vol. 2042. Springer Verlag. 69-85.
48. SOMOGYI, Z., HENDERSON, F., AND CONWAY, T. 1996. The execution algorithm of Mercury, an efficient purely declarative logic programming language. J. Logic Program. 29, 1-3, 17-64.
49. STERLING, L. AND SHAPIRO, E. 1994. The Art of Prolog, 2nd ed. MIT Press, Cambridge, MA.
50. TABOCH, C., GENAIM, S., AND CODISH, M. 2002. Terminweb: Semantic based termination analyser for logic programs, http://www.cs.bgu.ac.il/~mcodish/TarminWeb.
51. VANHOOF, W. AND BRUYNOOGHE, M. 2002. When size does matter. In Logic Based Program Synthesis and Transformation, 11th International Workshop (LOPSTR), A. Pettorossi, ed. Lecture Notes in Computer Science, vol. 2372. Springer Verlag. 129-147.
52. VAUCHERET, C. AND BUENO, F. 2002. More precise yet efficient type inference for logic programs. In Proceedings of the 9th International Static Analysis Symposium. M. Hermenegildo and G. Puebla, eds. Lecture Notes in Computer Science, vol. 2477. Springer Verlag. 102-116.