Verifying termination and error-freedom of logic programs with block declarations

Theory and Practice of Logic Programming

Volumn 1, Issue 4, 2001, Pages 447-486

  Smaus, Jan Georg ^a   Hill, Patricia M ^b   King, Andy ^c  

^a CWI   (Netherlands)

^b UNIVERSITY OF LEEDS   (United Kingdom)

^c UNIVERSITY OF KENT   (United Kingdom)

Author keywords

Builtins; Delay declarations; Errors; Modes; Selection rule; Termination; Types; Verification

Indexed keywords

EID: 0041854316     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068401001107     Document Type: Article

References (28)

1. Apt, K. R. (1997) From Logic Programming to Prolog. Prentice Hall.
2. Apt, K. R. and Etalle, S. (1993) On the unification free Prolog programs. In: A. Borzyszkowski and S. Sokolowski (eds.), Proceedings of the Conference on Mathematical Foundations of Computer Science: Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 1-19.
3. Apt, K. R. and Luitjes, I. (1995) Verification of logic programs with delay declarations. In: V. S. Alagar and M. Nivat (eds.), Proceedings of AMAST'95: Lecture Notes in Computer Science, Springer-Verlag, Berlin.
4. Apt, K. R. and Pellegrini, A. (1994) On the occur-check free Prolog programs. ACM Trans. Programming Lang. and Syst. 16(3), 687-726.
5. Bezem, M. (1993) Strong termination of logic programs. J. Logic Programming, 15(1 & 2), 79-97.
6. Bossi, A. and Cocco, N. (1999) Successes in logic programs. In: P. Flener (ed.), Proceedings of the 8th International Workshop on Logic Program Synthesis and Transformation: Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 219-239.
7. Boye, J. (1996) Directional Types in Logic Programming. PhD thesis, Linköpings Universitet.
8. Bronsard, F., Lakshman, T. K. and Reddy, U. S. (1992) A framework of directionality for proving termination of logic programs. In: K. R. Apt (ed.), Proceedings of the 9th Joint International Conference and Symposium on Logic Programming, MIT Press, pp. 321-335.
9. Cavedon, L. (1989) Continuity, consistency and completeness properties for logic programs. In: G. Levi and M. Martelli (eds.), Proceedings of the 6th International Conference on Logic Programming, MIT Press, pp. 571-584.
10. De Schreye, D. and Decorte, S. (1994) Termination of logic programs: The never-ending story. J. Logic Programming, 19/20, 199-260.
11. Deransart, P. and Małuszyński, J. (1998) Towards soft typing for CLP. In: F. Fages (ed.), JICSLP'98 Post-Conference Workshop on Types for Constraint Logic Programming, École Normale Supérieure. (Available at http://discipl.inria.fr/TCLP98/.)
12. Dershowitz, N. (1987) Termination of rewriting. J. Symbolic Computation, 3(1 & 2), 69-115. (Corrigendum 4(3), 409-410.)
13. Etalle, S., Bossi, A. and Cocco, N. (1999) Termination of well-moded programs. J. Logic Programming, 38(2), 243-257.
14. Hill, P. M. and Lloyd, J. W. (1994) The Gödel Programming Language. MIT Press.
15. Hill, P. M. (ed.) (1998) ALP Newsletter, http://www-lp.doc.ic.ac.uk/alp/. pp. 17, 18.
16. Lloyd, J. W. (1987) Foundations of Logic Programming. Springer-Verlag.
17. Lüttringhaus-Kappel, S. (1993) Control generation for logic programs. In: D. S. Warren (ed.), Proceedings of the 10th International Conference on Logic Programming, MIT Press, pp. 478-195.
18. Marchiori, E. and Teusink, F. (1999) Termination of logic programs with delay declarations. J. of Logic Programming, 39(1-3), 95-124.
19. Martin, J. C. and King, A. M. (1997) Generating efficient, terminating logic programs. In: M. Bidoit and M. Dauchet (eds.), Proceedings of TAPSOFT'97: Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 273-284.
20. Naish, L. (1985) Automatic control of logic programs. J. Logic Programming, 2(3), 167-183.
21. Naish, L. (1992) Coroutining and the construction of terminating logic programs. Technical Report 92/5, University of Melbourne.
22. Pedreschi, D. and Ruggieri, S. (1999) On logic programs that do not fail. In: S. Etalle and J.-G. Smaus (eds.), Proceedings of the Workshop on Verification, organised within ICLP'99: Electronic Notes in Theoretical Computer Science 30, Elsevier.
23. SIC (1998) SICStus Prolog User's Manual. http://www.sics.se/sicstus/docs/3.7.1/html/sicstus_toc .html.
24. Smaus, J.-G. (1999) Modes and Types in Logic Programming. PhD thesis, University of Kent at Canterbury. (Available from www.cs.ukc.ac.uk/pubs/1999/986.)
25. Smaus, J.-G., Hill, P. M. and King, A. M. (1998) Termination of logic programs with block declarations running in several modes. In: C. Palamidessi (ed.), Proceedings of the 10th Symposium on Programming Language Implementations and Logic Programming: Lecture Notes in Computer Science, Springer-Verlag, Berlin.
26. Smaus, J.-G., Hill, P. M. and King, A. M. (1999) Preventing instantiation errors and loops for logic programs with multiple modes using block declarations. In: P. Flener (ed.), Proceedings of the 8th International Workshop on Logic-based Program Synthesis and Transformation: Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 289-307.
27. Somogyi, Z., Henderson, F. and Conway, T. (1996) The execution algorithm of Mercury, an efficient purely declarative logic programming language. J. Logic Programming, 29(1-3), 17-64
28. Sterling, L. and Shapiro, E. (1986) The Art of Prolog. MIT Press.