Derivation of proof methods by abstract interpretation

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

Volumn 1490, Issue , 1998, Pages 102-117

  Levi, Giorgio ^a   Volpe, Paolo ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Abstract domains; Abstract interpretation; Inductive proof methods

Indexed keywords

APPLICATION PROGRAMS; COMPUTER CIRCUITS; LOGIC PROGRAMMING; MODEL CHECKING;

ABSTRACT DOMAINS; ABSTRACT INTERPRETATIONS; INDUCTIVE METHOD; LOGIC PROGRAMS; PROOF METHODS; VERIFICATION FRAMEWORK; VERIFICATION METHOD;

ABSTRACTING;

EID: 84947811506     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0056610     Document Type: Conference Paper

References (28)

1. K. Apt. From Logic Programming to Prolog. Prentice Hall, 1997.
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, Amsterdam and The MIT Press, Cambridge, 1990.
3. K. R. Apt and E. Marchiori. Reasoning about Prolog Programs: from Modes through Types to Assertions. Formal Aspects of Computing, 3, 1994.
4. G. Birkhoff. Lattice Theory. In AMS Colloquium Publication, third ed., 1967.
5. A. Bossi and N. Cocco. Verifying Correctness of Logic Programs. In J. Diaz and F. Orejas, editors, Proc. TAPSOFT’89, pages 96-110, 1989.
6. F. Bourdoncle. Abstract debugging of higher-order imperative languages. In Programming Languages Design and Implementation ’93, pages 46-55, 1993.
7. J. Boye and J. Maluszynski. Directional Types and the Annotation Method. Journal of Logic Programming, 33(3): 179-220, 1997.
8. 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 Proc. of the 3rd. Inťl Workshop on Automated Debugging-AADEBUG’97, pages 155-170, Linköping, Sweden, May 1997. U. of Linköping Press.
9. K. L. Clark. Predicate logic as a computational formalism. Res. Report DOC 79/59, Imperial College, Dept, of Computing, London, 1979.
10. M. Comini. An abstract interpretation framework for Semantics and Diagnosis of logic programs. PhD thesis, Dipartimento di Informatica, Università di Pisa, 1998.
11. M. Comini, G. Levi, and M. C. Meo. Compositionality of SLD-derivations and their abstractions. In J. Lloyd, editor, Proceedings of the 1995 Inťl Symposium on Logic Programming, pages 561-575. The MIT Press, 1995.
12. M. Comini, G. Levi, M. C. Meo, and G. Vitiello. Abstract Diagnosis. Submitted for publication, 1996.
13. M. Comini, G. Levi, M. C. Meo, and G. Vitiello. Proving properties of logic programs by abstract diagnosis. In M. Dams, editor, Analysis and Verification of Multiple-Agent Languages, 5th LOMAPS Workshop, number 1192 in Lecture Notes in Computer Science, pages 22-50. Springer-Verlag, 1996.
14. M. Comini and M. C. Meo. Compositionality Properties of SLD- derivations. Theoretical Computer Science, 1997. To appear. Available at http: / /www. di. unipi. it / ~comini/papers. html.
15. P. Cousot. Methods and Logics for Proving Programs. In J. V. Leeuwen, editor, Formal Methods and Semantics, volume B of Handbook of Theoretical Computer Science, pages 843-993. Elsevier Science Publishers B. V. (North-Holland), 1990.
16. P. Cousot. Constructive Design of a Hierarchy of Semantics of a Transition system by Abstract Interpretation. Electronic Notes in Theoretical Computer Science, 6, 1997. URL:http://www. elsevier. nl/locate/entcs/volume6. html.
17. 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.
18. P. Cousot and R. Cousot. Systematic Design of Program Analysis Frameworks. In Proc. Sixth ACM Symp. Principles of Programming Languages, pages 269-282, 1979.
19. P. Cousot and R. Cousot. Abstract Interpretation Frameworks. Journal of Logic and Computation, 2(4):511-549, 1992.
20. P. Cousot and R. Cousot. Inductive Definitions, Semantics and Abstract Interpretation. In Proc. Nineteenth Annual ACM Symp. on Principles of Programming Languages, pages 83-94. ACM Press, 1992.
21. P. Deransart. Proof Methods of Declarative Properties of Definite Programs. Theoretical Computer Science, 118(2):99-166, 1993.
22. W. Drabent. It is Declarative. In ILPS’97. Workshop on Verification, Model Checking and Abstract Interpretation, 1997.
23. W. Drabent and J. Maluszynski. Inductive Assertion Method for Logic Programs. Theoretical Computer Science, 59(1):133-155, 1988.
24. 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.
25. R. Giacobazzi and F. Ranzato. Completeness in abstract interpretation: A domain perspective. In M. Johnson, editor, Proc. of the 6th International Conference on Algebraic Methodology and Software Technology (AMAST’97), volume 1349 of Lecture Notes in Computer Science, pages 231-245. Springer-Verlag, Berlin, 1997.
26. 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), number 850 in LNCS, pages 287-304. Springer Verlag, 1994.
27. 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’96), number 1139 in LNCS, pages 209223. Springer Verlag, 1996.
28. D. Park. Fixpoint Induction and Proofs of Program Properties. In B. Meltzer and D. Michie, editors, Machine Intelligence, number 5, pages 59-78. Edinburgh Univ. Press, 1969.