CLP(x) for automatically proving program properties

Journal of Logic Programming

Volumn 37, Issue 1-3, 1998, Pages 77-93

  Mesnard, F ^a   Hoarau, S ^a   Maillard, A ^a  

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

Author keywords

Constraint logic programming; Proof theory; Verifying and reasoning about programs

Indexed keywords

ALGEBRA; CONSTRAINT THEORY; DECISION THEORY; EXPERT SYSTEMS; THEOREM PROVING;

GENERIC PROOF METHOD;

LOGIC PROGRAMMING;

EID: 0032186730     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(98)10004-3     Document Type: Article

References (30)

1. K.R. Apt, Program verification and prolog, in: E. Börger (Ed.), Specification and Validation Methods for Programming Languages and Systems, Oxford University Press, Oxford, 1995, pp. 55-95.
2. K.R. Apt, From Logic Programming to Prolog, Prentice- Hall, Englewood Cliffs, NJ, 1997.
3. K.R. Apt, M. Gabbrielli, D. Pedreschi, A closer look at declarative interpretations, J. Logic Programming 28 (2) (1996) 147-180.
4. A. Bossi, N. Cocco, Verifying correctness of logic programs, in: Proceedings of TAPSOFT'89, LNCS 352, Springer, Berlin, 1989, pp. 96-110.
5. K.L. Clark, Predicate logic as a computational formalism, Technical Report Doc 79/59, Logic Programming Group, Imperial College, London, 1979.
6. A. Colmerauer, Equations and inequations on finite and infinite trees, in: Proceedings of FGCS'84, 1984, pp. 85-99.
7. A. Colmerauer, An introduction to prolog III, CACM 33 (7) (1990) 70-90.
8. L. Colussi, E. Marchiori, Proving correctness of logic programs using axiomatic semantics, in: Proceedings of ICLP'91, MIT Press, Cambridge, MA, 1991, pp. 629-642.
9. E. Contejean, Solving linear diophantine constraints incrementally, in: Proceedings of ICLP'93, MIT Press, Cambridge, MA, 1993.
10. F. de Boer, M. Gabbrielli, E. Marchiori, C. Palamidessi, Proving concurrent constraint programs correct (to appear).
11. P. Deransart, Proof methods of declarative properties of definite programs, Theoret. Comput. Sci. (1993) 99-166.
12. M. Dincbas, P. Van Hentenrick, H. Simonis, A. Aggoun, T. Graf, F. Berthier, The constraint logic programming language CHIP, in: Proceedings of FGCS'88, 1988, pp. 693-702.
13. W. Drabent, J. Maluszynski, Inductive assertion method for logic programs, Theoret. Comput. Sci. 59 (1) (1988) 133-155.
14. L. Fribourg, H. Olsén, Datalog programs with arithmetical constraints: Hierarchic, periodic and spiralling least fixpoints, Technical report, L.I.E.N.S, France, 1995.
15. S. Grigorieff, Décidabilité et complexité des théories logiques, Logique et informatique: Une introduction, collection didactique, INRIA, 1989, pp. 7-97.
16. D. Hofstadter, Gödel, Escher, Bach: An Eternal Golden Braid, Basic Books, New York, 1979.
17. H. Hong, Non-linear real constraints in constraint logic programming, LNCS 632, Springer, Berlin, 1992, pp. 201-212.
18. J. Jaffar, J.L. Lassez, Constraint logic programming, Technical Report 74, Monach University, Australia, 1986.
19. J. Jaffar, M.J. Maher, Constraint logic programming: A survey, J. Logic Programming (1994) 503-581.
20. J. Jaffar, S. Michaylov, P.J. Stuckey, R.H.C. Yap, The CLP(R) language and system, in: Proceedings of the ICLP'87 MIT Press, Cambridge, MA, 1987.
21. P.T. Johnstone, Notes on Logic and Set Theory, Cambridge Mathematical Textbooks, Cambridge University Press, Cambridge, London, 1986.
22. T. Kanamori, H. Fujita, Formulation of induction formulas in verification of prolog programs, in: Proceedings of the Eighth CADE, LNCS, Springer, Berlin, 1986, pp. 281-299.
23. J.M. Lever, Proving program properties by means of SLS-resolution, in: Proceedings of the ICLP'91, MIT Press, Cambridge, MA, 1991, pp. 614-628.
24. J.W. Lloyd, Foundations of Logic Programming, Springer, Berlin, 1987.
25. Z. Manna, Mathematical Theory of Computation, McGraw-Hill, New York, 1974.
26. M.L. Minsky, Recursive unsolvability of post's problem of 'tag' and other topics in the theory of Turing machines, Ann. of Math. 74 (1961) 437-455.
27. S. Renault, Generalized Extended Execution for Normal Programs, in: Proceedings of Lopstr'94, LNCS, Springer, Berlin, 1994.
28. S. Ruggieri, Decidability of Logic Program Semantics and Application to Testing, in: Proceedings of Plilp'96, LNCS 1140, Springer, Berlin, 1996.
29. J.C. Shepherdson, Unsolvable problems for SLDNF resolution, J. Logic Programming (1991) 19-22.
30. C. Walinsky, CLP(Σ*): Constraint logic programming with regular sets, in: Proceedings of ICLP'89, MIT Press, Cambridge, MA, 1989, pp. 181-196.