Abstract interpretation based verification of logic programs

Electronic Notes in Theoretical Computer Science

Volumn 30, Issue 1, 1999, Pages 22-38

  Comini, Marco ^a   Gori, Roberta ^a   Levi, Giorgio ^a   Volpe, Paolo ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; DATA ACQUISITION; FUNCTIONS; PROBLEM SOLVING; PROGRAM DEBUGGING; SEMANTICS;

DATA FLOW; DOMAINS; PROGRAM ANALYSIS; PROGRAM VERIFICATION;

LOGIC PROGRAMMING;

EID: 19144367836     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00112-4     Document Type: Conference Paper

References (41)

1. Apt K.R., Marchiori E. Reasoning about Prolog programs: from modes through types to assertions. Formal Aspects of Computing. 6:(6A):1994;743-765
2. A. Bossi and N. Cocco. Verifying correctness of logic programs. In J. Diaz and F. Orejas, editors, Proceedings of TAPSOFT'89, pages 96-110, 1989.
3. Bossi A., Gabbrielli M., Levi G., Martelli M. The s-semantics approach: Theory and applications. Journal of Logic Programming. 19-20:1994;149-197
4. Bourdoncle F. Abstract debugging of higher-order imperative languages. Programming Languages Design and Implementation '93. 1993;46-55
5. M. Bruynooghe, H. Vandecasteele, D.A. de Waal, and M. Denecker. Detecting unsolvable queries for definite logic programs. In Palamidessi, Glaser, and Meinke, editors, Proc. 10th Int'l Conf. and Symp. Principle of Declarative Programming, Lecture Notes in Computer Science, pages 118-133. Springer-Verlag, 1998.
6. F. Bueno, P. Deransart, W. Drabent, G. Ferrand, M. Hermenegildo, J. Maluszynski, and G. Puebla. On the role of semantic approximations in validation and diagnosis of constraint logic programs. In M. Kamkar, editor, Proceedings of the AADEBUG'97 (The Third International Workshop on Automated Debugging), pages 155-169. Linköping University, 1997.
7. K. L. Clark. Predicate logic as a computational formalism. Res. Report DOC 79/59, Imperial College, Dept. of Computing, London, 1979.
8. M. Comini. An abstract Interpretation Framework for Semantics and Diagnosis of logic Programs. PhD thesis, Dipartimento di Informatica, Universitá di Pisa, 1998.
9. M. Commi, G. Levi, and M. C. Meo. A theory of observables for logic programs. Information of Computation. To appear.
10. Comini M., Levi G., Meo M.C., Vitiello G. Abstract diagnosis. Journal of Logic Programming. 39:(1-3):1999;43-93
11. Comini M., Meo M.C. Compositionality properties of SLD-derivations. Theoretical Computer Science. 211:(1-2):1999;275-309
12. A. Cortesi, B. Le Charlier, and S. Rossi. Specification-based automatic verification of prolog programs. In Proceedings of LOPSTR '96, volume 1207 of Lecture Notes in Computer Science, pages 38-57, Springer-Verlag, 1996.
13. P. Cousot. Constructive design of a hierarchy of semantics of a transition system by abstract interpretation. In S. Brookes and M. Mislove, editors, Proceedings of the 13th International symposium on Mathematical Foundations of Programming Semantics MFPS'97, volume 6 of Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam, 1997. URL: http://www.elsevier.nl/locate/entcs/volume6.html.
14. P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proceedings of Fourth ACM Symp. Principles of Programming Languages, pages 238-252, 1977.
15. P. Cousot and R. Cousot. Systematic Design of Program Analysis Frameworks. In Proceedings of Sixth ACM Symp. Principles of Programming Languages, pages 269-282, 1979.
16. Cousot P., Cousot R. Abstract Interpretation Frameworks. Journal of Logic and Computation. 2:(4):1992;511-549
17. P. Cousot and R. Cousot. Inductive Definitions, Semantics and Abstract Interpretation. In Proceedings of Nineteenth Annual ACM Symp. on Principles of programming Languages, pages 83-94. ACM Press, 1992.
18. Deransart P. Proof methods of declarative properties of definite programs. Theoretical Computer Science. 118:(2):1993;99-166
19. W. Drabent. It is Declarative. In Workshop on Verification, Model Checking and Abstract Interpretation, ILPS'97, 1997.
20. Drabent W., Maluszynski J. Inductive assertion method for logic programs. Theoretical Computer Science. 59:(1):1988;133-155
21. Ferrand G. Error Diagnosis in Logic Programming, an Adaptation of E. Y. Shapiro's Method. Journal of Logic Programming. 4:1987;177-198
22. G. Ferrand. The notions of symptom and error in declarative diagnosis of logic programs. In P. A. Fritzson, editor, Automated and Algorithmic Debugging, Proceedings of AADEBUG '93, volume 749 of Lecture Notes in Computer Science, pages 40-57. Springer-Verlag, 1993.
23. Filè G., Giacobazzi R., Ranzato F. A unifying view on abstract domain design. ACM Computing Surveys. 28:(2):1996;333-336
24. Gabbrielli M., Levi G., Meo M.C. Observable Behaviors and Equivalences of Logic Programs. Information of Computation. 122:(1):1995;1-29
25. R. Giacobazzi and F. Ranzato. Functional dependencies and Moore-set completions of abstract interpretations and semantics. In J. Lloyd, editor, Proceedings of the 1995 International Symposium on Logic Programming (ILPS'95), pages 321-335. The MIT Press, 1995.
26. R. Giacobazzi and F. Ranzato. Completeness in abstract interpretation: A domain perspective. In M. Johnson, editor, Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology (AMAST'97), Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1997.
27. R. Giacobazzi and F. Scozzari. Intuitionistic implication in abstract interpretation. In H. Glaser, P. Hartel, and H. Kuchen, editors, Proceedings of Ninth International Symposium on Programming Languages, Implementations, Logics and Programs PLILP'97, volume 1292 of Lecture Notes in Computer Science, pages 175-189. Springer-Verlag, 1997.
28. R. Gori. A fixpoint semantics for reasoning about finite failure. In H. Ganzinger, D. McAllester, and A. Voronkov, editors, Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning, volume 1705 of LNAI, pages 238-257, Tbilisi, Republic of Georgia, 1999.
29. Gori R., Levi G. Finite failure is and-compositional. Journal of Logic and Computation. 7:(6):1997;753-776
30. R. Gori and G. Levi. On the verification of finite failure. In Proceedings of the International Conference on Prinicples and Practice of Declarative Programming, LNCS, pages 311-327, Paris, France, 1999. Springer.
31. B. Le Charlier, C. Leclère, S. Rossi, and A. Cortesi. Automatic verification of behavioral properties of prolog programs. In Proceedings of ASIAN'97, volume 1345 of Lecture Notes in Computer Science, pages 225-237. Springer-Verlag, 1997.
32. D. Le Métayer. Proving properties of progress defined over recursive data structures. In Proceedings ACM PEPM '95, pages 88-99, 1995.
33. G. Levi and F. Spoto. An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs. In C. Palamidessi, H. Glaser, and K. Meinke, editors, Priciples of Declarative Programming. 10th International Symposium, PLILP'98, volume 1490 of Lecture Notes in Computer Science, pages 152-169, Pisa, Italy, September 1998. Springer-Verlag.
34. G. Levi and P. Volpe. Derivation of proof methods by abstract interpretation. In C. Palamidessi, H. Glaser, and K. Meinke, editors, Priciples of Declarative Programming. 10th International Symposium, PLILP'98, volume 1490 of Lecture Notes in Computer Science, pages 102-117, Pisa, Italy, September 1998. Springer-Verlag.
35. E. Marchiori. A Logic for Variable Aliasing in Logic Programs. In G. Levi and M. Rodriguez-Artalejo, editors, Proceedings of the 4th International Conference on Algebraic and Logic Programming (ALP'94), volume 850 of Lecture Notes in Computer Science, pages 287-304. Springer Verlag, 1994.
36. E. Marchiori. Design of Abstract Domains using First-order Logic. In M. Hanus and M. Rodriguez-Artalejo, editors, Proceedings of the 5th International Conference on Algebraic and Logic Programming (ALP'960), volume 1139 of Lecture Notes in Computer Science, pages 209-223, Springer Verlag, 1996.
37. G. Necula. Proof-carrying code. In Proceedings of the 24th Symposium on Principles of Programming Languages, 1997.
38. F. Scozzari. Logical optimality of groundness analysis. In P. Van Hentenryck, editor, Proceedings of International Static Analysis Symposium, SAS'97, volume 1302 of Lecture Notes in Computer Science, pages 83-97. Springer-Verlag, 1997.
39. E. Y. Shapiro. Algorithmic program debugging. In Proceedings of Ninth Annual ACM Symp. on Principles of Programming Languages, pages 412-531. ACM Press, 1982.
40. P. Volpe. A first-order language for expressing aliasing and type properties of logic programs. In G. Levi, editor, Static Analysis, Proceedings of the 5th International Symposium, SAS'98, volume 1503 of Lecture Notes in Computer Science, pages 184-199. Springer-Verlag, 1998.
41. P. Volpe. Derivation of proof methods for logic programs by abstract interpretation. PhD thesis, Dipartimento di Matematica, Università di Napoli Federico II, 1999.