Verification of logic programs

Journal of Logic Programming

Volumn 39, Issue 1, 1999, Pages 125-176

  Pedreschi, Dino ^a   Ruggieri, Salvatore ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; PROGRAM DIAGNOSTICS; PROLOG (PROGRAMMING LANGUAGE);

HOARE'S LOGIC; PROGRAM CORRECTNESS; PROGRAM VERIFICATION; PROOF THEORY;

LOGIC PROGRAMMING;

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

References (54)

1. K.R. Apt, M. Bezem, Acyclic programs, in: D.H.D. Warren, P. Szeredi (Eds.), Proceedings of the Seventh International Conference on Logic Programming, MIT Press, Cambridge, MA, 1990, pp. 617-633.
2. K.R. Apt, R. Bol, Logic programming and negation: a survey, Journal of Logic Programming 19-20 (1994) 9-71.
3. K.R. Apt, H.C. Doets, A new definition of SLDNF-resolution, Journal of Logic Programming 18 (2) (1994) 177-190.
4. K.R. Apt, I. Luitjes, Verification of logic programs with delay declarations, in: V.S. Alagar, M. Nivat (Eds.), Proc. of AMAST'95, Lecture Notes in Computer Science vol. 936, Springer, Berlin, 1995, pp. 66-90.
5. K.R. Apt, D. Pedreschi, Modular termination proofs for logic and pure Prolog programs, in: G. Levi (Ed.), Advances in Logic Programming Theory, Oxford University Press, Oxford, 1994, pp. 183-229.
6. K.R. Apt, A. Pellegrini, On the occur-check free Prolog programs, ACM Toplas 16 (3) (1994) 687-726.
7. K.R. Apt, Logic programming, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B, Elsevier, Amsterdam, 1990, pp. 493-574.
8. K.R. Apt, From Logic Programming to Prolog, International Series in Computer Science, C.A.R. Hoare Series Editor, Prentice Hall, Englewood Cliffs, NJ, 1997.
9. K.R. Apt, M. Gabbrielli, D. Pedreschi, A closer look at declarative interpretations, Journal of Logic Programming 28 (2) (1996) 147-180.
10. K.R. Apt, E. Marchiori, Reasoning about Prolog programs: from modes through types to assertions, Formal Aspects of Computing A 6 (1994) 743-764.
11. K.R. Apt, E. Marchiori, C. Palamidessi, A declarative approach for first-order built-in's of Prolog. Applicable Algebra in Engineering, Communication and Computation 5 (3/4) (1994) 159-191.
12. K.R. Apt and E.R. Olderog. Verification of Sequential and Concurrent Programs. Texts and Monographs in Computer Science. Springer-Verlag, Berlin, 1991.
13. K.R. Apt, D. Pedreschi, Reasoning about termination of pure prolog programs, Information and Computation 106 (1) (1993) 109-157.
14. M. Bezem, Characterizing termination of logic programs with level mappings, in: E.L. Lusk, R.A. Overbeek (Eds.), Proceedings of the North American Conference on Logic Programming, MIT Press, Cambridge, MA, 1989, pp. 69-80.
15. H.A. Blair, The recursion-theoretic complexity of predicate logic as a programming language, Information and Control 54 (1982) 25-47.
16. A. Bossi, N. Cocco, Verifying correctness of logic programs, in: J. Diaz, F. Orejas (Eds.), TAPSOFT '89, Lecture Notes in Computer Science vol. 352, Springer, Berlin, 1989, pp. 96-110.
17. A. Bossi, N. Cocco, M. Fabris, Norms on terms and their use in proving universal termination of a logic program, Theoretical Computer Science 124 (1994) 297-328.
18. A. Bossi, M. Gabbrielli, G. Levi, M. Martelli, The ℒ-semantics approach: theory and applications. Journal of Logic Programming 19/20 (1994) 149-197.
19. J. Boye, J. Maluszynski, Two aspects of directional types, in: L. Sterling (Ed.), Proceedings of the 1995 International Conference on Logic Programming, MIT Press, Cambridge, MA, 1995, pp. 747-761.
20. F. Bronsard, T.K. Lakshman, U.S. Reddy, A framework of directionality for proving termination of logic programs, in: K.R. Apt (Ed.), Proceedings of the 1992 Joint Int. Conference and Symposium on Logic Programming, MIT Press, Cambridge, MA, 1992, pp. 321-335.
21. L. Cavedon, Acyclic logic programs and the completeness of SLDNF-resolution, Theoretical Computer Science 86 (1991) 81-92.
22. K.L. Clark, Predicate logic as a computational formalism. Technical Report DOC 79/59, Imperial College, Department of Computing, 1979.
23. L. Colussi, E. Marchiori, Proving correctness of logic programs using axiomatic semantics, in: Proceedings of the Eight International Conference on Logic Programming, MIT Press, Cambridge, MA, 1991, pp. 629-644.
24. L. Crnogorac, A.D. Kelly, H. Søndergaard, A comparison of three occur-check analysers, Proc. of SAS'96, Lecture Notes in Computer Science vol. 1145, Springer, Berlin, 1996, pp. 159-173.
25. F.S. de Boer, M. Gabbrielli, E. Marchiori, C. Palamidessi, Proving concurrent constraint programs correct, ACM Transactions on Programming Languages and Systems 19 (1997) (5) 685-725.
26. F.S. de Boer and C. Palamidessi M. Gabbrielli. Proving Correctness of Constraint Logic Programs with Dynamic Scheduling. In Proc. of SAS'96, of Lecture Notes in Computer Science vol. 1145, Springer-Verlag, Berlin, 1996, pp. 83-97.
27. P. Dembinski and J. Maluszynski. AND-parallelism with intelligent backtracking for annotated logic programs, in: Proceedings of the International Symposium on Logic Programming, Boston, 1985, pp. 29-38.
28. P. Deransart, Proof methods of declarative properties of definite programs, Theoretical Computer Science 118 (1993) 99-166.
29. N. Dershowitz, Termination of rewriting, Journal of Symbolic Computation 8 (1987) 69-116.
30. Y. Deville, Logic Programming: Systematic Program Development. Addison-Wesley, Reading, MA, 1990.
31. E.W. Dijkstra, A Discipline of Programming, Prentice Hall, Englewood Cliffs, NJ, 1976.
32. W. Drabent, J. Maluszynski, Inductive assertion method for logic programs, Theoretical Computer Science 59 (1) (1988) 133-155.
33. M. Ducassé, J. Noyé, Logic programming environments: dynamic program analysis and debugging, Journal of Logic Programming 19-20 (1994) 351-384.
34. M. Falaschi, G. Levi, M. Martelli, C. Palamidessi, Declarative modelling of the operational behaviour of logic languages, Theoretical Computer Science 69 (3) (1989) 289-318.
35. M. Falaschi, G. Levi, M. Martelli, C. Palamidessi, A model-theoretic reconstruction of the operational semantics of logic programs, Information and Computation 103 (1) (1993) 86-113.
36. G. Ferrand, P. Deransart, Proof method of partial correctness and weak completeness for normal logic programs, Journal of Logic Programming 17 (1993) 265-278.
37. C.J. Hogger, Derivations of logic programs, Journal of the ACM 28 (2) (1981) 372-392.
38. C.J. Hogger, Introduction to Logic Programming, Academic Press, London, 1984.
39. J.-M. Jacquet (Ed.), Constructing Logic Programs, Wiley, Chichester, England, 1993.
40. M. Kalsbeek. Correctness of the vanilla meta-interpreter and ambivalent syntax, in: K.R. Apt, F. Turini (Eds.), Meta-logics and Logic Programming, MIT Press, Cambridge, MA, 1995, pp. 3-26.
41. J.W. Lloyd, Foundations of Logic Programming, second edition, Springer, Berlin, 1987.
42. B. Malfon, Characterization of some semantics for logic programs with negation and application to program validation. in: M. Bruynooghe (Ed.), Proceedings of the International Symposium on Logic Programming, MIT Press, Cambridge, MA, 1994, pp. 91-105.
43. L. Naish, Types and the intended meaning of logic programs, in: F. Pfenning (Ed.), Types in Logic Programming, MIT Press, Cambridge, MA, 1992, pp. 189-216.
44. L. Naish, Verification of logic programs and imperative programs, in: J.-M. Jacquet (Ed.), Constructing Logic Programs, Wiley, Chichester, 1993, pp. 143-164.
45. L. Naish, A declarative view of modes, in: M.J. Maher (Ed.), Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming, MIT Press, Cambridge, MA, 1996.
46. D. Pedreschi, S. Ruggieri, Modular verification of logic programs, in: F.S. de Boer, M. Gabbrielli (Ed.), Proceedings of the W2 Post-Conference Workshop of the 1996 JICSLP, Tech. Report TR-96-31. Dipartimento di Informatica, Università di Pisa, 1996.
47. D. Pedreschi, S. Ruggieri, Verification of logic programs. Technical Report 97-05, Dipartimento di Informatica, Università di Pisa, 1997, A collection of case studies is available at the URL: http://www.di.unipi.it/∼ruggieri/Verification/cases.html.
48. D. Pedreschi, S. Ruggieri, Verification of metainterpreters, Journal of Logic and Computation 7 (2) (1997) 267-303.
49. D. Pedreschi, S. Ruggieri, Weakest preconditions for pure Prolog programs, Information Processing Letters 67 (3) (1998) 145-150.
50. S. Ruggieri, Decidability of logic program semantics and applications to testing, Proceedings of PLILP'96, Lecture Notes in Computer Science vol. 1140, Springer, Berlin, 1996, pp. 347-362.
51. D. De Schreye, S. Decorte, Termination of logic programs: the never-ending story, Journal of Logic Programming 19-20 (1994) 199-260.
52. J. Shoenfield, Mathematical Logic, Addison Wesdley, Reading, MA, 1967.
53. R.F. Stärk, Formal verification of logic programs: foundations and implementations, in: S. Adian, A. Nerode (Eds.), LFCS '97, Lecture Notes in Computer Science vol. 1234, Springer, Berlin, 1997, pp. 354-368.
54. L. Sterling, E. Shapiro, The Art of Prolog, MIT Press, Cambridge, MA, 1986.