Inference of termination conditions for numerical loops in Prolog

Theory and Practice of Logic Programming

Volumn 4, Issue 5-6, 2004, Pages 719-751

  Serebrenik, Alexander ^a   De Schreye, Danny ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Numerical computation; Termination analysis

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; CONFORMAL MAPPING; INTEGRATION; LOGIC PROGRAMMING;

NATURAL NUMBERS; NUMERICAL COMPUTATIONS; TERMINATION ANALYSIS; TERMINATION CONDITIONS;

COMPUTER PROGRAMMING;

EID: 4444295655     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068404002042     Document Type: Conference Paper

References (60)

1. APT, K. R. 1997. From Logic Programming to Prolog. Series in Computer Science. Prentice Hall.
2. APT, K. R., MARCHIORI, E. AND PALAMIDESSI, C. 1994. A declarative approach for first-order built-in's in Prolog. Applicable Algebra in Engineering, Communication and Computation 5, 3/4, 159-191.
3. BJØRNER, N., BROWNE, A. AND MANNA, Z. 1997. Automatic generation of invariants and intermediate assertions. Theoretical Computer Science 173, 1 (February), 49-87.
4. BOL, R. N. 1991. Loop checking in logic programming. PhD thesis, Universiteit van Amsterdam.
5. BOSSI, A. AND COCCO, N. 1994. Preserving universal temination through unfold/fold. In Algebraic and Logic Programming, G. Levi and M. Rodríguez-Artalejo, Eds. Lecture Notes in Computer Science, vol. 850. Springer Verlag, pp. 269-286.
6. BOSSI, A., COCCO, N., ETALLE, S. AND ROSSI, S. 2002. On modular termination proofs of general logic programs. Theory and Practice of Logic Programming 2, 3, 263-291.
7. BOSSI, A., COCCO, N. AND FABRIS, M. 1991. Proving Termination of Logic Programs by Exploiting Term Properties. In Proceedings CCPSD-TAPSOFT'91. Lecture Notes in Computer Science, vol. 494. Springer Verlag, pp. 153-180.
8. BOSSI, A., COCCO, N. AND FABRIS, M. 1994. Norms on terms and their use in proving universal termination of a logic program. Theoretical Computer Science 124, 2 (February), 297-328.
9. BRATKO, I. 1986. Prolog programming for Artificial Intelligence. Addison-Wesley.
10. BRUYNOOGHE, M., CODISH, M., GENAIM, S. AND VANHOOF, W. 2002. Reuse of results in termination analysis of typed logic programs. In Static Analysis, 9th International Symposium, M. V. Hermenegildo and G. Puebla, Eds. Lecture Notes in Computer Science, vol. 2477. Springer Verlag, pp. 477-492.
11. BUENO, F., GARCÍA DE LA BANDA, M. J. AND HERMENEGILDO, M. V. 1994. Effectiveness of global analysis in strict independence-based automatic parallelization. In Logic Programming, Proceedings of the 1994 International Symposium, M. Bruynooghe, Ed. MIT Press, pp. 320-336.
12. CLOCKSIN, W. F. AND MELLISH, C. S. 1981. Programming in Prolog. Springer-Verlag.
13. CODISH, M. AND TABOCH, C. 1999. A semantic basis for termination analysis of logic programs. Journal of Logic Programming 41, 1, 103-123.
14. COELHO, H. AND COTTA, J. C. 1988. Prolog by example. Springer-Verlag.
15. COLÓN, M. A. AND SIPMA, H. B. 2001. Synthesis of linear ranking functions. In Tools and Algorithms for the Construction and Analysis of Systems, 7th International Conference, T. Margaria and W. Yi, Eds. Lecture Notes in Computer Science, vol. 2031. Springer Verlag, pp. 67-81.
16. COLÓN, M. A. AND SIPMA, H. B. 2002. Practical methods for proving program termination. In Computer Aided Verification, 14th International Conference, E. Brinksma and K. Guldstrand Larsen, Eds. Lecture Notes in Computer Science, vol. 2404. Springer Verlag, pp. 442-454.
17. COLUSSI, L., MARCHIORI, E. AND MARCHIORI, M. 1995. On termination of constraint logic programs. In Principles and Practice of Constraint Programming - CP'95,, U. Montanari and F. Rossi, Eds. Lecture Notes in Computer Science, vol. 976. Springer Verlag, pp. 431-448.
18. COUSOT, P. AND COUSOT, R. 1976. Static determination of dynamic properties of programs. In Proceedings of the Second International Symposium on Programming. Dunod, Paris, France, pp. 106-130.
19. COUSOT, P. AND COUSOT, R. 1977. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, NY, Los Angeles, CA, pp. 238-252.
20. DE SCHREYE, D., VERSCHAETSE, K. AND BRUYNOOGHE, M. 1990. A practical technique for detecting non-terminating queries for a restricted class of Horn clauses, using directed, weighted graphs. In Logic Programming, Proceedings of the Seventh International Conference, D. H. Warren and P. Szeredi, Eds. MIT Press, pp. 649-663.
21. 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 International Conference on Fifth Generation Computer Systems., I. Staff, Ed. IOS Press, pp. 481-488.
22. DECORTE, S. AND DE SCHREYE, D. 1998. Termination analysis: some practical properties of the norm and level mapping space. In Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming, J. Jaffar, Ed. MIT Press, pp. 235-249.
23. DECORTE, S., DE SCHREYE, D. AND VANDECASTEELE, H. 1999. Constraint-based termination analysis of logic programs. ACM TOPLAS 21, 6 (November), 1137-1195.
24. DERSHOWITZ, N., LINDENSTRAUSS, N., SAGIV, Y. AND SEREBRENIK, A. 2001. A general framework for automatic termination analysis of logic programs. Applicable Algebra in Engineering, Communication and Computing 12, 1-2, 117-156.
25. FLOYD, R. W. 1967. Assigning meanings to programs. In Mathematical Aspects of Computer Science, J. Schwartz, Ed. American Mathematical Society, 19-32. Proceedings of Symposiumsia in Applied Mathematics; v. 19.
26. GENAIM, S. AND CODISH, M. 2001. Inferring termination conditions for logic programs using backwards analysis. In Logic for Programming, Artificial Intelligence, and Reasoning, 8th International Conferencerence, Proceedings, R. Nieuwenhuis and A. Voronkov, Eds. Lecture Notes in Computer Science, vol. 2250. Springer-Verlag, pp. 685-694.
27. GENAIM, S., CODISH, M., GALLAGHER, J. AND LAGOON, V. 2002. Combining norms to prove termination. In Third International Workshop on Verification, Model Checking and Abstract Interpretation, A. Cortesi, Ed. Lecture Notes in Computer Science, vol. 2294. Springer-Verlag, pp. 126-138.
28. HETT, W. 2001. P-99: Ninety-nine Prolog problems. Available at http://www.hta-bi.bfh. ch/~hew/informatik3/prolog/p-99/.
29. HOLZBAUR, C. 1995. OFAI CLP(Q,R) Manual. Tech. Rep. TR-95-09, Austrian Research Institute for Artificial Intelligence, Vienna.
30. ILOG. 2001. ILOG Solver 5.1 User's Manual. ILOG s.a.http://www.ilog.com.
31. IT MASTERS. 2000. MasterProLog Programming Environment. Available at http://www.itmasters.com/.
32. JANSSENS, G. AND BRUYNOOGHE, M. 1992. Deriving descriptions of possible values of program variables by means of abstract interpretation. Journal of Logic Programming 13, 2&3 (July), 205-258.
33. JANSSENS, G., BRUYNOOGHE, M. AND ENGLEBERT, V. 1994. Abstracting numerical values in CLP(H, N). In Programming Language Implementation and Logic Programming, 6th International Symposiumsium, PLILP'94, M. V. Hermenegildo and J. Penjam, Eds. Lecture Notes in Computer Science, vol. 844. Springer-Verlag, pp. 400-414.
34. KATZ, S. AND MANNA, Z. 1975. A closer look at termination. Acta Informatica 5, 333-352.
35. LINDENSTRAUSS, N. AND SAGIV, Y. 1997. Automatic termination analysis of logic programs. In Proceedings of the Fourteenth International Conference on Logic Programming, L. Naish, Ed. MIT Press, pp. 63-77.
36. LINDENSTRAUSS, N., SAGIV, Y. AND SEREBRENIK, A. 1997. TermiLog: A system for checking termination of queries to logic programs. In Computer Aided Verification, 9th International Conference, O. Grumberg, Ed. Lecture Notes in Computer Science, vol. 1254. Springer-Verlag, pp. 444-447.
37. LINDENSTRAUSS, N., SAGIV, Y. AND SEREBRENIK, A. 1998. Unfolding the mystery of mergesort. In Proceedings of the 7th International Workshop on Logic Program Synthesis and Transformation, N. Fuchs, Ed. Lecture Notes in Computer Science, vol. 1463. Springer-Verlag, pp. 206-225.
38. MCDONALD, C. AND YAZDANI, M. 1990. Prolog programming: a tutorial introduction. Artificial Intelligence Texts. Blackwell Scientific Publications.
39. MESNARD, F. 1996. Inferring left-terminating classes of queries for constraint logic programs. In Proceedings of the 1996 Joint International Conference and Syposium on Logic Programming, M. Maher, Ed. MIT Press, Cambridge, MA, USA, pp. 7-21.
40. MESNARD, F. AND NEUMERKEL, U. 2001. Applying static analysis techniques for inferring termination conditions of logic programs. In Static Analysis, 8th International Symposium, SAS 2001, P. Cousot, Ed. Lecture Notes in Computer Science, vol. 2126. Springer-Verlag, pp. 93-110.
41. MESNARD, F., PAYET, E. AND NEUMERKEL, U. 2002. Dectecting optimal termination conditions of logic programs. In Static Analysis, 8th International Symposium, SAS 2002, P. Cousot, Ed. Lecture Notes in Computer Science, vol. 2477. Springer-Verlag, pp. 509-527.
42. MESNARD, F. AND RUGGIERI, S. 2003. On proving left termination of constraint logic programs. ACM Transaction on Computational Logic 4, 2, 207-259.
43. OHLEBUSCH, E. 2001. Automatic termination proofs of logic programs via rewrite systems. Applicable Algebra in Engineering, Communication and Computing 12, 1-2, 73-116.
44. O'KEEFE, R. A. 1990. The Craft of Prolog. MIT Press, Cambridge, MA.
45. PLÜMER, L. 1990. Termination proofs for logic programs based on predicate inequalities. In Proceedings of ICLP'90. MIT Press, pp. 634-648.
46. PLÜMER, L. 1991. Automatic termination proofs for Prolog programs operating on nonground terms. In International Logic Programming Symposium. MIT Press.
47. POLLARD, C. AND SAG, I. A. 1994. Head-driven Phrase Structure Grammar. University of Chicago Press.
48. RUGGIERI, S. 1997. Termination of constraint logic programs. In Automata, Languages and Programming, 24th International Colloquium, ICALP'97, P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, Eds. Lecture Notes in Computer Science, vol. 1256. Springer-Verlag, pp. 838-848.
49. 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, Selected Papers, K.-K. Lau, Ed. Lecture Notes in Computer Science, vol. 2042. Springer-Verlag, pp. 69-85.
50. SEREBRENIK, A. AND DE SCHREYE, D. 2002. On termination of logic programs with floating point computations. In 9th International Static Analysis Symposium, M. V. Hermenegildo and G. Puebla, Eds. Lecture Notes in Computer Science, vol. 2477. Springer-Verlag, pp. 151-164.
51. SHEN, Y.-D. 1997. An extended variant of atoms loop check for positive logic programs. New Generation Computing 15, 2, 187-204.
52. SHEN, Y.-D., YUAN, L.-Y. AND YOU, J.-H. 2001. Loop checks for logic programs with functions. Theoretical Computer Science 266, 1-2, 441-461.
53. SICS. 2002, SICStus User Manual. Version 3.10.0. Swedish Institute of Computer Science.
54. SKORDEV, D. 1997. An abstract approach to some loop detection problems. Fundamenta Informaticae 31, 2, 195-212.
55. SOHN, K. AND VAN GELDER, A. 1991. Termination detection in logic programs using argument sizes. In Proceedings of the Tenth ACM SIGACT-SIGART-SIGMOD Symposium on Principles of Database Systems. ACM Press, pp. 216-226.
56. STERLING, L. AND SHAPIRO, E. 1994. The Art of Prolog. The MIT Press, Cambridge, MA.
57. ULLMAN, J. D. AND VAN GELDER, A. 1988. Efficient tests for top-down termination of logical rules. Journal of the ACM 35, 2 (April), 345-373.
58. VERBAETEN, S., SAGONAS, K. AND DE SCHREYE, D. 2001. Termination proofs for logic programs with tabling. ACM Transactions on Computational Logic 2, 1, 57-92.
59. VERSCHAETSE, K. AND DE SCHREYE, D. 1991. Deriving termination proofs for logic programs, using abstract procedures. In Logic Programming, Proceedings Eighth International Conference, K. Furukawa, Ed. MIT Press, pp. 301-315.
60. WINSBOROUGH, W. 1992. Multiple specialization using minimal-function graph semantics. Journal of Logic Programming 13, 2/3, 259-290.