Proving properties of logic programs by abstract diagnosis

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

Volumn 1192 LNCS, Issue , 1997, Pages 22-50

  Comini, Marco ^a   Levi, Giorgio ^a   Meo, Maria Chiara ^b   Vitiello, Giuliana ^c  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF L'AQUILA   (Italy)

^c UNIVERSITY OF SALERNO   (Italy)

Author keywords

Debugging; Declarative diagnosis; Logic programming; Semantics; Verification

Indexed keywords

ABSTRACT INTERPRETATIONS; BOTTOM-UP AND TOP-DOWN; DIAGNOSIS TECHNIQUES; FINITE DOMAINS; LOGIC PROGRAMS; OPERATIONAL PROPERTIES; SEMANTIC FRAMEWORK; VERIFICATION METHOD;

COMPUTER DEBUGGING; LOGIC PROGRAMMING; SEMANTICS; VERIFICATION;

PROGRAM DIAGNOSTICS;

EID: 84878652764     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62503-8_2     Document Type: Conference Paper

References (47)

1. A. Aiken and T. K. Lakshman. Directional type checking of logic programs. In B. Le Charlier, editor, Proc. Static Analysis Symposium, SAS'94, volume 864 of Lecture Notes in Computer Science, pages 43-60. Springer-Verlag, 1994.
2. K. R. Apt. Introduction to Logic Programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 495-574. Elsevier and The MIT Press, 1990.
3. K. R. Apt. Program verification and Prolog. In E. Börger, editor, Specification and validation methods for programming languages and systems. Oxford University Press, 1994.
4. K. R. Apt, M. Gabbrielli, and D. Pedreschi. A closer look to declarative interpretations. Journal of Logic Programming, 28(2):147-180, 1996.
5. K. R. Apt and E. Marchiori. Reasoning about Prolog programs: from modes through types to assertions. Formal Aspects of Computing, 6(6A):743-765, 1994.
6. K. R. Apt and D. Pedreschi. Reasoning about termination of pure PROLOG programs. Information and Computation, 106(1):109-157, 1993.
7. T. Armstrong, K. Marriott, P. Schachte, and H. Søndergaard. Boolean functions for dependency analysis: Algebraic properties and efficient representation. In B. Le Charlier, editor, Proc. Static Analysis Symposium, SAS'94, volume 864 of Lecture Notes in Computer Science, pages 266-280. Springer-Verlag, 1994.
8. A. Bossi, M. Gabbrielli, G. Levi, and M. Martelli. The s-semantics approach: Theory and applications. Journal of Logic Programming, 19-20:149-197, 1994.
9. K. L. Clark. Predicate logic as a computational formalism. Res. Report DOC 79/59, Imperial College, Dept. of Computing, London, 1979.
10. C. Click and K. D. Cooper. Combining analyses, combining optimizations. ACM Transactions on Programming Languages and Systems, 17(2):181-196, 1995.
11. M. Codish, A. Mulkers, M. Bruynooghe, M. Garcia de la Banda, and M. Hermenegildo. Improving abstract interpretations by combining domains. ACM Transactions on Programming Languages and Systems, 17(1):28-44, 1995.
12. P. Codognet and G. Filè. Computations, Abstractions and Constraints. In Proc. Fourth IEEE Int'l Conference on Computer Languages. IEEE Press, 1992.
13. M. Comini and G. Levi. An algebraic theory of observables. In M. Bruynooghe, editor, Proceedings of the 1994 Int'l Symposium on Logic Programming, pages 172-186. The MIT Press, 1994.
14. M. Comini, G. Levi, and M. C. Meo. Compositionality of SXD-derivations and their abstractions. In J. Lloyd, editor, Proceedings of the 1995 Int'l Symposium on Logic Programming, pages 561-575. The MIT Press, 1995.
15. M. Comini, G. Levi, and M. C. Meo. A theory of observables for logic programs. Submitted for publication, 1996.
16. M. Comini, G. Levi, and G. Vitiello. Abstract debugging of logic programs. In L. Fribourg and F. Turini, editors, Proc. Logic Program Synthesis and Transformation and Metaprogramming in Logic 1994, volume 883 of Lecture Notes in Computer Science, pages 440-450. Springer-Verlag, 1994.
17. M. Comini, G. Levi, and G. Vitiello. Declarative diagnosis revisited. In J. Lloyd, editor, Proceedings of the 1995 Int'l Symposium on Logic Programming, pages 275-287. The MIT Press, 1995.
18. M. Comini, G. Levi, and G. Vitiello. Efficient detection of incompleteness errors in the abstract debugging of logic programs. In M. Ducassé, editor, Proc. 2nd International Workshop on Automated and Algorithmic Debugging, AADEBUG'95, 1995.
19. M. Comini and M. C. Meo. Compositionality properties of SLD-derivations. Submitted for publication, 1996.
20. A. Cortesi, G. Filé, R. Giacobazzi, C. Palamidessi, and F. Ranzato. Complementation in abstract interpretation. In A. Mycroft, editor, Proceedings of the 2nd International Static Analysis Symposium (SAS '95), volume 983 of Lecture Notes in Computer Science, pages 100-117. Springer-Verlag, 1995. To appear in ACM Transactions on Programming Languages and Systems.
21. A. Cortesi, G. Filè, and W. Winsborough. Prop revisited: Propositional Formula as Abstract Domain for Groundness Analysis. In Proc. Sixth IEEE Symp. on Logic In Computer Science, pages 322-327. IEEE Computer Society Press, 1991. (Pubitemid 21691972)
22. P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proc. Fourth ACM Symp. Principles of Programming Languages, pages 238-252, 1977.
23. P. Cousot and R. Cousot. Systematic Design of Program Analysis Frameworks. In Proc. Sixth ACM Symp. Principles of Programming Languages, pages 269-282, 1979.
24. P. Cousot and R. Cousot. Abstract Interpretation and Applications to Logic Programs. Journal of Logic Programming, 13(2 & 3):103-179, 1992.
25. P. Cousot and R. Cousot. Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation. In M. Bruynooghe and M. Wirsing, editors, Proc. of PLILP'92, volume 631 of Lecture Notes in Computer Science, pages 269-295. Springer-Verlag, 1992.
26. P. Cousot and R. Cousot. Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and per analysis of functional languages). In Proceedings of the IEEE International Conference on Computer Languages (ICCL '94), pages 95-112. IEEE Computer Society Press, 1994.
27. E. Eder. Properties of substitutions and unifications. Journal of Symbolic Computation, 1:31-46, 1985.
28. M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative Modeling of the Operational Behavior of Logic Languages. Theoretical Computer Science, 69(3):289-318, 1989. (Pubitemid 20646244)
29. M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs. Information and Computation, 102(1): 86-113, 1993.
30. G. Ferrand. Error Diagnosis in Logic Programming, an Adaptation of E. Y. Shapiro's Method. Journal of Logic Programming, 4:177-198, 1987.
31. G. Ferrand. The notions of symptom and error in declarative diagnosis of logic programs. In P. A. Fritzson, editor, Automated and Algorithmic Debugging, Proc. AADEBUG '93, volume 749 of Lecture Notes in Computer Science, pages 40-57. Springer-Verlag, 1993.
32. G. Filé, R. Giacobazzi, and F. Ranzato. A unifying view on abstract domain design. ACM Computing Surveys, 28(2):333-336, 1996. (Pubitemid 126627752)
33. G. Filé and F. Ranzato. Improving abstract interpretations by systematic lifting to the powerset. In M. Bruynooghe, editor, Proceedings of the 1994 International Logic Programming Symposium (ILPS '94), pages 655-669. The MIT Press, 1994.
34. R. Giacobazzi, S.K. Debray, and G. Levi. Generalized Semantics and Abstract Interpretation for Constraint Logic Programs. Journal of Logic Programming, 25(3):191-247, 1995.
35. R. Giacobazzi and F. Ranzato. Functional dependencies and Moore-set completions of abstract interpretations and semantics. In J. Lloyd, editor, Proceedings of the 1995 Interantional Symposium on Logic Programming (ILPS '95), pages 321-335. The MIT Press, 1995.
36. R. Giacobazzi and F. Ranzato. Compositional optimization of disjunctive abstract interpretations. In H.R. Nielson, editor, Proc. of the 1996 European Symposium on Programming, volume 1058 of Lecture Notes in Computer Science, pages 141-155. Springer-Verlag, 1996. (Pubitemid 126064375)
37. J. L. Lassez, M. J. Maher, and K. Marriott. Unification Revisited. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 587-625. Morgan Kaufmann, Los Altos, Ca., 1988.
38. J. W. Lloyd. Declarative error diagnosis. New Generation Computing, 5(2):133-154, 1987.
39. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987. Second edition.
40. E. Marchiori. Prime factorizations of abstract domains using first order logic. In M. Hanus and M. Rodriguez-Artalejo, editors, Algebraic and Logic Programming, volume 1139 of Lecture Notes in Computer Science, pages 209-223. Springer-Verlag, 1996. (Pubitemid 126129072)
41. K. Marriott and H. Søndergaaxd. Precise and efficient groundness analysis for logic programs. ACM Letters on Programming Languages and Systems, 2(1-4): 181-196, 1993.
42. L. Naish. Declarative diagnosis of missing answers. New Generation Computing, 10:255-285, 1991.
43. L. M. Pereira. Rational debugging in logic programming. In E. Y. Shapiro, editor, Proceedings of the 3rd International Conference on Logic Programming, volume 225 of Lecture Notes in Computer Science, pages 203-210. Springer-Verlag, 1986.
44. T. Sato and H. Tamaki. Enumeration of Success Patterns in Logic Programs. Theoretical Computer Science, 34:227-240, 1984.
45. E. Y. Shapiro. Algorithmic program debugging. In Proc. Ninth Annual ACM Symp. on Principles of Programming Languages, pages 412-531. ACM Press, 1982.
46. L. Sterling and E. Y. Shapiro. The Art of Prolog. The MIT Press, 1986.
47. M. H. van Emden and R. A. Kowalski. The semantics of predicate logic as a programming language. Journal of the ACM, 23(4):733-742, 1976.