Reuse of results in termination analysis of typed logic programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2477, Issue , 2002, Pages 477-492

  Bruynooghe, Maurice ^a   Codish, Michael ^b   Genaim, Samir ^b   Vanhoof, Wim ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE REUSABILITY; LOGIC PROGRAMMING;

COMPONENT BASED; CONTEXT INDEPENDENT; INFORMATION CONCERNING; LOGIC PROGRAMS; POLYMORPHIC TYPES; PROGRAM COMPONENTS; SIMPLE TYPES; TERMINATION ANALYSIS;

STATIC ANALYSIS;

EID: 84958746416     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45789-5_33     Document Type: Conference Paper

References (26)

1. K. R. Apt. Introduction to logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 495–574. Elsevier, Amsterdam and The MIT Press, Cambridge, 1990.
2. A. Bossi, N. Cocco, S. Etalle and S. Rossi. On modular termination proofs of general logic programs. Theory and Practice of Logic Programming, 2(3):263–291, 2002.
3. A. Bossi, N. Cocco, and M. Fabris. Proving termination of logic programs by exploiting term properties. In S. Abramsky and T.S.E. Maibaum, editors, Proceedings of Tapsoft 1991, volume 494 of Lecture Notes in Computer Science, pages 153–180. Springer-Verlag, Berlin, 1991.
4. A. Bossi, N. Cocco, and M. Fabris. Typed norms. In B. Krieg-Br¨uckner, editor, Proceeedings ESOP ’92, volume 582 of Lecture Notes in Computer Science, pages 73–92. Springer-Verlag, Berlin, 1992.
5. M. Bruynooghe, M. Codish, S. Genaim, and W. Vanhoof. Reuse of results in termination analysis of typed logic programs. Technical Report, July, 2002.
6. M. Bruynooghe, W. Vanhoof, and M. Codish. Pos(t): Analyzing dependencies in typed logic programs. In Perspectives of System Informatics, 4th International Andrei Ershov Memorial Conference, (PSI). Lecture Notes in Computer Science, vol. 2244. Springer-Verlag, 406–420.
7. M. Codish and C. Taboch. A semantic basis for the termination analysis of logic programs. The Journal of Logic Programming, 41(1):103–123, 1999.
8. D. De Schreye, C. Verschaetse, and M. Bruynooghe. A framework for analysing the termination of definite logic programs with respect to call patterns. In ICOT, editor, Proc. of the Fifth Generation Computer Systems, FGCS92, pages 481–488. ICOT, 1992.
9. S. Decorte, D. De Schreye, and H. Vandecasteele. Constraint based automatic termination analysis of Logic Programs. ACM Trans. Program. Lang. Syst., 21(6):1137–1195, November 1999.
10. S. Decorte and D. De Schreye. Demand-driven and constraint-based automatic left-termination analysis for logic programs. In Naish [24], pages 78–92.
11. S. Decorte, D. De Schreye, and M. Fabris. Automatic inference of norms: A missing link in automatic termination analysis. In D. Miller, editor, Logic Programming - Proceedings of the 1993 International Symposium, pages 420–436, Vancouver, Canada, 1993. MIT Press.
12. S. Decorte, D. De Schreye, and M. Fabris. Integrating types in termination analysis. Technical Report CW 222, K.U.Leuven, Department of Computer Science, January 1996.
13. J. Gallagher and G. Puebla. Abstract Interpretation over Non-Deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs. In Shriram Krishnamurthi and C. R. Ramakrishnan, editors, Practical Aspects of Declarative Languages, 4th International Symposium, PADL 2002, Portland, OR, USA, January 19-20, 2002, volume 2257 of Lecture Notes in Computer Science, pages 243–261. Springer, 2002.
14. S. Genaim, M. Codish, J. Gallagher, and V. Lagoon. Combining norms to prove termination. In Agostino Cortesi, editor, Third International Workshop on Verification, Model Checking and Abstract Interpretation, volume 2294 of Lecture Notes in Computer Science, pages 126–138. Springer-Verlag, January 2002.
15. R. Giacobazzi, S. K. Debray, and G. Levi. Generalized semantics and abstract interpretation for constraint logic programs. The Journal of Logic Programming, 25(3):191–247, Dec. 1995.
16. A. King, K. Shen, and F. Benoy. Lower-bound time-complexity analysis of logic programs. In Jan Maluszynski, editor, International Symposium on Logic Programming, pages 261–276. MIT Press, November 1997.
17. V. Lagoon and P. Stuckey. A framework for analysis of typed logic programs. In FLOPS, volume 2024 of Lecture Notes in Computer Science, pages 296–310. Springer-Verlag, Berlin, 2001.
18. N. Lindenstrauss and Y. Sagiv. Automatic termination analysis of logic programs. In Naish [24], pages 63–77.
19. J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, 2nd edition, 1987.
20. K. Marriott and H. Søndergaard. Precise and efficient groundness analysis for logic programs. ACM Letters on Programming Languages and Systems, 2(1 4):181–196, 1993.
21. J. Martin and A. King. Typed norms for typed logic programs. In Logic Program Synthesis and Transformation. Springer-Verlag, August 1996. Available at http://www.cs.ukc.ac.uk/pubs/1996/511.
22. F. Mesnard and U. Neumerkel. Applying static analysis techniques for inferring termination conditions of logi programs. In Static Analysis Symposium, 2001.
23. A. Mycroft and R.A. O’Keefe. A Polymorphic Type System for Prolog. Artificial Intelligence 23(3): 295-307 1984.
24. L. Naish, editor. Proceedings of Fourteenth International Conference on Logic Programming, Leuven (Belgium), 1997. The MIT press.
25. Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of Mercury, an efficient purely declarative logic programming language. Journal of Logic Programming, 29(1 3):17–64, October–November 1996.
26. W. Vanhoof and M. Bruynooghe. When size does matter -Termination analysis for typed logic programs. Logic Based Program Synthesis and Transformation, LOPSTR 2001, Revised Papers, LNCS, Springer 2002. To appear.