Automated verification of Prolog programs

Journal of Logic Programming

Volumn 39, Issue 1, 1999, Pages 3-42

  Le Charlier, Baudouin ^a   Leclère, Christophe ^a   Rossi, Sabina ^a   Cortesi, Agostino ^a  

^a UNIVERSITY OF NAMUR   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM DIAGNOSTICS; PROLOG (PROGRAMMING LANGUAGE);

ABSTRACT INTERPRETATION; AUTOMATIC PROGRAM VERIFICATION; DECLARATIVE PROGRAMMING;

LOGIC PROGRAMMING;

EID: 0344613989     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(98)10032-8     Document Type: Article

References (69)

1. A. Aiken, T.K. Lakshman, Directional type checking of logic programs, in: B. Le Charlier (Ed.), First International Static Analysis Symposium, Namur, Belgium, September 1994, LNCS vol. 864, Springer, Berlin, 1994, pp. 43-60.
2. K.R. Apt, D. Pedreschi, Studies in pure prolog: Termination, in: J.W. Lloyd (Ed.), Proceedings of the Symposium on Computational Logic, volume 1 of Basic Research Series, Springer, Berlin, 1990, pp. 150-176.
3. K.R. Apt, From Logic Programming to Prolog, Prentice-Hall, Englewood Cliffs, NJ, 1997.
4. K.R. Apt, D. Pedreschi, Proving termination of general prolog programs, in: Proceedings of the International Conference on Theoretical Aspects of Computer Science, Sendai, Japan, 1991.
5. K.R. Apt, D. Pedreschi, Modular Termination Proofs For Logic And Pure Prolog Programs, Technical Report 6/93, Dipartimento di Informatica, Università di Pisa, 1993.
6. M. Bezem, Characterizing termination of logic programs with level mappings, J. Logic Programming 15 (1/2) (1992) 79-98.
7. A. Bossi, N. Cocco, M. Fabris, Typed norms, in: B. Krieg-Brueckner (Ed.), Proc. ESOP'92, LNCS vol. 582, Springer, Berlin, 1992, pp. 73-92.
8. A. Bossi, N. Cocco, M. Fabris, Norms on terms and their use in proving universal termination of a logic program, Theoret. Comput. Sci. 124 (2) (1994) 297-328.
9. C. Braem, B. Le Charlier, S. Modard, P. Van Hentenryck, Cardinality analysis of prolog, in: M. Bruynooghe (Ed.), Proceedings of the International Logic Programming Symposium (ILPS'94), MIT Press, Ithaca, NY, USA, November 1994.
10. M. Bruynooghe, A practical framework for the abstract interpretation of logic programs, J. Logic Programming 10 (2) (1991) 91-124.
11. A. Bundy, A. Smaill, G. Wiggins, The synthesis of logic programs from inductive proofs, in: J.W. Lloyd (Ed.), Computational Logic, Esprit Basic Research Series, 1990.
12. M. Codish, A. Mulkers, M. Bruynooghe, M. García de la Banda, M. Hermenegildo, Improving abstract interpretations by combining domains, in: Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, ACM Press, 1993, pp. 194-205.
13. M. Comini, G. Levi, M.C. Meo, G. Vitiello, Proving properties of logic programs by abstract diagnosis, in: Mads Dam (Ed.), Proceedings of the Fifth Workshop on Analysis and Verification of Multiple-Agent Languages (LOMAPS'96), June 1996, LNCS vol. 1192, Springer, Berlin, 1996.
14. A. Cortesi, B. Le Charlier, S. Rossi, Specification-based automatic verification of logic programs, in: Logic Program Synthesis and Transformation. Proceedings of the Sixth International Workshop, LOPSTR'96, August 1996, LNCS vol. 1207, Springer, Berlin, 1996.
15. A. Cortesi, B. Le Charlier, P. Van Hentenryck, Conceptual and software support for abstract domain design: Generic structural domain and open product, Technical Report, Institute of Computer Science, University of Namur, Belgium, (also Brown University), Namur, Belgium, 1993.
16. A. Cortesi, B. Le Charlier, P. Van Hentenryck, Combination of abstract domains for logic programming, in: Proceedings of the 21th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'94), Portland, Oregon, January 1994.
17. A. Cortesi, B. Le Charlier, P. Van Hentenryck, Type analysis of prolog using type graphs, J. Logic Programming 23 (3) (1995) 237-278.
18. P. Cousot, R. Cousot, Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Conference Record of Fourth ACM Symposium on Programming Languages (POPL'77), Los Angeles, California, January 1977, pp. 238-252.
19. P. Cousot, R. Cousot, Automatic synthesis of optimal invariant assertions: Mathematical foundation, in: Proceedings of the ACM Symposium on Artificial Intelligence and Programming Languages, SIGPLAN Notices, 1977, pp. 1-12.
20. P. Cousot, R. Cousot, Abstract interpretation and application to logic programs, J. Logic Programming 13 (2-3) (1992).
21. P. Cousot, R. Cousot, Abstract interpretation frameworks, J. Logic and Computation 2 (4) (1992) 511-547.
22. P. Cousot, R. Cousot (Eds.), Inductive definitions, semantics and abstract interpretation, in: Conference Record of the 19th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Programming Languages, ACM Press, New York, August 1992, pp. 83-94.
23. P. De Boeck, B. Le Charlier, Static type analysis of prolog procedures for ensuring correctness, in: Proceedings of Programming Language Implementation and Logic Programming PLILP'90, Linköping, Sweden, Springer, August 1990, LNCS vol. 456, Springer, Berlin, 1990, pp. 222-237.
24. P. De Boeck, B. Le Charlier, Mechanical transformation of logic definitions augmented with type information into prolog procedures: Some experiments, in: Proceedings of LOPSTR'93, Workshops in Computer Science, Springer, July 1993.
25. D. De Schreye, S. Decorte, Termination of logic programs: The never-ending story, J. Logic Programming Special anniversary edition, accepted for publication.
26. D. De Schreye, K. Verschaetse, M. Bruynooghe, A framework for analysing the termination of definite logic programs with respect to call patterns, in: Proceedings of the FGCS'92, ICOT Tokyo, 1992, ICOT, pp. 481-488.
27. S.K. Debray, N.W. Lin, Cost analysis of logic programs, ACM Trans. Programming Languages and Systems 15 (5) (1993) 826-875.
28. S.K. Debray, N.W. Lin, M. Hermenegildo, Task granularity analysis in logic programs, in: Proceedings ACM SIGPLAN'90 conference on programming language design and implementation, June 1990, pp. 174-188.
29. S.K. Debray, D.S. Warren, Functional computations in logic programs, ACM Transactions on Programming Languages and Systems (TOPLAS) 11 (3) (1989) 451-481.
30. S. Decorte, D. De Schreye, M. Fabris, Exploiting the power of typed norms in automatic inference of interargument relations, Technical Report, Department of Computer Science, K.U.Leuven, Belgium, 1994.
31. S. Decorte, D. De Schreye, M. Fabris, Automatic inference of norms: A missing link in automatic termination analysis, in: D. Miller (Ed.), Proceedings ILPS'93, Vancouver, Canada, 1993, pp. 420-436.
32. Y. Deville, Logic Programming: Systematic Program Development, MIT Press, Cambridge, 1990.
33. W. Drabent, J. Maluszyński, Inductive assertion method for logic programs, Theoret. Comput. Sci. 59 (1988) 133-155.
34. P. Flener, Y. Deville, Logic program synthesis from incomplete specifications, Journal of Symbolic Computation: Special Issue on Automatic Programming, 1993.
35. P. Flener, K.-K. Lau, Program schemas as steadfast programs, Technical Report BU-CEIS-97, Bilkent University, Department of Computer Science, 1997.
36. M. Gallardo, P. Merino, J.M. Troya, Relating abstract interpretation with logic program verification, in: A. Bossi (Ed.), ILPS'97 Post-Conference Workshop on Verification, Model-Checking and Abstract Interpretation, Port Jefferson, USA, 1997.
37. J. Henrard, B. Le Charlier, FOLON: An environment for declarative construction of logic programs (extended abstract), in: M. Bruynooghe, M. Wirsing (Eds.), Proceedings of the Fourth International Workshop on Programming Language Implementation and Logic Programming (PLILP'92), August 1992, LNCS vol. 631, Springer, Berlin, 1992.
38. D. Jacobs, A. Langen, Accurate and efficient approximation of variable aliasing in logic programs, in: E.L. Lusk, R.A. Overbeek (Eds.), Proceedings of the North American Conference on Logic Programming (NACLP'89), Cleveland, Ohio, October 1989. MIT Press, Cambridge, pp. 154-165.
39. G. Janssens, M. Bruynooghe, Deriving descriptions of possible values of program variables by means of abstract interpretation, J. Logic Programming 13 (2/3) (1992) 205-258.
40. G. Janssens, M. Bruynooghe, A. Mulkers, Abstract equation systems: Description and insights, Report CW217, Department of Computing Science, K.U.Leuven, November 1995.
41. N.D. Jones, H. Søndergaard, A semantic-based framework for the abstract interpretation of prolog, in: S. Abramsky, C. Hankin (Eds.), Abstract Interpretation of Declarative Languages, Ch. 6, Ellis Horwood, Chichester, 1987, pp. 123-142.
42. K.K. Lau, S.D. Prestwich, Top-down synthesis of recursive logic procedures from first-order logic specifications, in: D.H.D. Warren, P. Szeredi (Eds.), Proc. Seventh Int'l Conf. on Logic Programming, The MIT Press, Cambridge, MA, 1990, pp. 667-684.
43. B. Le Charlier, C. Leclère, S. Rossi, A. Cortesi, Automated verification of prolog programs, Research Paper RP-98-002, Institute of Computer Science, University of Namur, Belgium, 1998.
44. B. Le Charlier, S. Rossi, Sequence-based abstract semantics of prolog, Technical Report RR-96-001, Facultés Universitaires Notre-Dame de la Paix, Institut d'Informatique, February 1996.
45. B. Le Charlier, S. Rossi, P. Van Hentenryck, An abstract interpretation framework which accurately handles prolog search-rule and the cut, in: M. Bruynooghe (Ed.), Proceedings of the International Logic Programming Symposium (ILPS'94), MIT Press, Ithaca NY, USA, November 1994.
46. B. Le Charlier, S. Rossi, P. Van Hentenryck, Sequence-based abstract interpretation of prolog, Technical Report RR-97-001, Facultés Universitaires Notre-Dame de la Paix, Institut d'Informatique, January 1997.
47. B. Le Charlier, P. Van Hentenryck, Experimental evaluation of a generic abstract interpretation algorithm for prolog, ACM Transactions on Programming Languages and Systems (TOPLAS) 16 (1) (1994) 35-101.
48. B. Le Charlier, P. Van Hentenryck, Reexecution in abstract interpretation of prolog, Acta Informatica 32 (1995) 209-253.
49. C. Leclère, B. Le Charlier, Two dual abstract operations to duplicate, eliminate, equalize, introduce and rename place-holders occurring inside abstract descriptions, Research Paper RP-96-028, University of Namur, Belgium, September 1996.
50. G. Levi, P. Volpe, A reconstruction of verification techniques by abstract interpretation, in: A. Bossi (Ed.), ILPS'97 Post-Conference Workshop on Verification, Model-Checking and Abstract Interpretation, Port Jefferson, USA, 1997.
51. J.W. Lloyd, Foundations of Logic Programming. Springer Series: Symbolic Computation-Artificial Intelligence, 2nd ed. Springer, Berlin, 1987.
52. K. Marriott, H. Søndergaard, Semantics-based dataflow analysis of logic programs, in: G. Ritter (Ed.), Information Processing'89, San Fransisco, California, 1989, pp. 601-606.
53. C.S. Mellish, Abstract interpretation of prolog programs, in: S. Abramsky, C. Hankin (Eds.), Abstract Interpretation of Declarative Languages, Ch. 8, Ellis Horwood, Chichester, 1987, pp. 181-198.
54. Daniel Le Métayer, Program analysis for software engineering: New applications, new requirements, new tools, ACM Computing Surveys, 28 (4es) (1996) 167-167.
55. K. Musumbu, Interprétation Abstraite de Programmes Prolog. Ph.D. Thesis, Institute of Computer Science, University of Namur, Belgium, September 1990 (in French).
56. K. Muthukumar, M. Hermenegildo, Compile-time derivation of variable dependency using abstract interpretation, J. Logic Programming 13 (2/3) (1992) 315-347.
57. U. Nilsson, Systematic semantic approximations of logic programs, in: P. Deransart, J. Małuszyński (Eds.), Proceedings of the International Workshop on Programming Language Implementation and Logic Programming (PLILP'90), Linköping, Sweden, August 1990, LNCS vol. 456, Springer, Berlin, 1990, pp. 293-306.
58. L. Plümer, Termination proofs for logic programs based on predicate inequalities, in: Proceedings ICLP'90, Jerusalem, MIT Press, Cambridge, June 1990, pp. 634-648.
59. L. Plümer, Automatic termination proofs for prolog programs operating on nonground terms, in: Proceedings ILPS'91, San Diego, MIT Press, Cambridge, October 1991, pp. 503-517.
60. L. Plümer, Automatic verification of GHC-programs: Termination, in: Proceedings FGCS'92, Tokyo, 1992.
61. Z. Somogyi, F. Henderson, T. Conway, The execution algorithm of mercury, an efficient purely declarative logic programming language, J. Logic Programming 29 (1-3) (1996) 17-64.
62. H. Søndergaard, An application of abstract interpretation of logic programs: Occur check reduction, in: B. Robinet, R. Wilhelm (Eds.), Proceedings of the European Symposium on Programming (ESOP'86), Saarbruecken, Germany, March 1986, LNCS vol. 213, Springer, Berlin, 1986, pp. 327-338.
63. J.D. Ullman, A. Van Gelder, Efficient tests for top-down termination of logical rules, J. ACM 35 (2) (1988) 345-373.
64. P. Van Hentenryck, A. Cortesi, B. Le Charlier, Evaluation of Prop, J. Logic Programming 23 (3) (1995) 237-278.
65. K. Verschaetse, Static termination analysis for definite Horn clause programs, Ph.D. Thesis, Department of Computer Science, K.U. Leuven, 1992.
66. K. Verschaetse, D. De Schreye, Deriving termination proofs for logic programs, using abstract procedures, in: Proceedings ICLP'91, Paris, MIT Press, Cambridge, MA, June 1991, pp. 301-315.
67. K. Verschaetse, S. Decorte, D. De Schreye, Automatic termination analysis, in: Proceedings LOPSTR'92, LNCS vol. 883, Springer, Berlin, 1993.
68. G.A. Wiggins, Synthesis and transformation of logic programs in the Whelk proof development system, in: Proc. of the 1992 Joint International Conference and Symposium on Logic Programming. The MIT Press, Cambridge, MA, 1992.
69. D.K. Wilde, A library for doing polyhedral operations, Technical Report No. 785, IRISA-Institut de Recherche en Informatique et Systèmes Aléatoires, Rennes, France, 1993.