Termination analysis with types is more accurate

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

Volumn 2916, Issue , 2003, Pages 254-268

  Lagoon, Vitaly ^a   Mesnard, Fred ^b   Stuckey, Peter J ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b UNIVERSITÉ DE LA RÉUNION   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GROUNDNESS; HINDLEY/MILNER; LOGIC PROGRAMS; TERMINATION ANALYSIS; TYPE INFORMATION;

LOGIC PROGRAMMING; ABSTRACTING; COMPUTER CIRCUITS; RECONFIGURABLE HARDWARE;

COMPUTER SOFTWARE REUSABILITY;

EID: 0346895317     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24599-5_18     Document Type: Conference Paper

References (26)

1. K. R. Apt. From Logic Programming to Prolog. Prentice Hall, 1997.
2. T. Armstrong, K. Marriott, P. Schachte, and H. Sondergaard. Two classes of Boolean functions for dependency analysis. Science of Computer Programming, 31(1):3-45, 1998.
3. R. Bagnara, E. Ricci, E. Zaffanella, and P. M. Hill. Possibly not closed convex polyhedra and the Parma Polyhedra Library. SAS, LNCS 2477:213-229, 2002.
4. A. Bossi, N. Cocco, and M. Fabris. Typed norms. ESOP, LNCS 582:73-92, 1992.
5. M. Bruynooghe, M. Codish, S. Genaim, and W. Vanhoof. Reuse of results in termination analysis of typed logic programs. SAS, LNCS 2477:477-492, 2002.
6. M. Bruynooghe, M. Codish, S. Genaim, and W. Vanhoof. A note on the reuse of results in termination analysis of typed logic programs. Forthcoming TR, Dpt CS, K.U. Leuven, 2003.
7. M. Bruynooghe, W. Vanhoof, and M. Codish. Pos(T) : Analyzing dependencies in typed logic programs. PSI, LNCS 2244:406-420, 2001.
8. P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. POPL, 238-252, 1977.
9. S. Decorte, D. De Schreye, and M. Fabris. Exploiting the power of typed norms in automatic inference of interargument relations. TR 246, Dpt CS, K.U.Leuven, 1997.
10. F. Fages and E. Coquery. Typing constraint logic programs. Theory and Practice of Logic Programming, 1(6):751-777, 2001.
11. J. Gallagher and A. de Waal. Fast and precise regular approximations of logic programs. ICLP, pages 599-613. MIT Press, 1994.
12. J. Gallagher and G. Puebla. Abstract interpretation over non-deterministic finite tree automata for set-based analysis of logic programs. SAS, LNCS 2257:243-261, 2002.
13. M. García de la Banda, B. Demoen, K. Marriott, and P.J. Stuckey. To the Gates of HAL: A HAL tutorial. LNCS, 2441:47-66, 2002.
14. S. Genaim, M. Codish, J. Gallagher, and V. Lagoon. Combining norms to prove termination. VMCAI, LNCS 2294:126-138, 2002.
15. N. Halbwachs. Détermination Automatique de Relations Linéaires Vérifiées par les Variables d'un Programme. PhD thesis, USM de Grenoble, France, 1979.
16. P. Hill and J. Lloyd. The Gödel Language. MIT Press, 1994.
17. J. Jaffar, M. Maher, K. Marriott, and P.J. Stuckey. The semantics of constraint logic programs. Journal of Logic Programming, 37(1-3):1-46, 1998.
18. V. Lagoon and P. J. Stuckey. Polymorphic analysis of typed logic programs. TR, Dpt CSSE, University of Melbourne, Australia, 2003. www.cs.mu.oz.au/~pjs/papers/poly-tr.ps
19. J. Martin, A. King, and P. Soper. Typed norms for typed logic programs. LOPSTR, LNCS 1207:224-238, 1996.
20. F. Mesnard and U. Neumerkel. Applying static analysis techniques for inferring termination conditions of logic programs. SAS, LNCS 2126:93-110, 2001.
21. R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:348-375, 1978.
22. A. Mycroft and R. A. O'Keefe. A Polymorphic Type System for Prolog. Artificial Intelligence, 23:295-307, 1984.
23. C. Okasaki. Purely Functional Data Structures. Cambridge University Press, 1998.
24. 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, 1996.
25. C. Speirs, Z. Somogyi, and H. Søndergaard. Termination analysis for Mercury. SAS, LNCS 1302:160-171, 1997.
26. W. Vanhoof and M. Bruynooghe. When size does matter. LOPSTR, LNCS 2372:129-147, 2002.