How to transform an analyzer into a verifier

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

Volumn 2250, Issue , 2001, Pages 595-609

  Comini, Marco ^a   Gori, Roberta ^b   Levi, Giorgio ^b  

^a UNIVERSITY OF UDINE   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; LOGIC PROGRAMMING;

ABSTRACT INTERPRETATIONS; AUTOMATIC VERIFICATION TOOLS; DIFFERENT DOMAINS; FUNCTIONAL PROGRAMS; POLYMORPHIC TYPES; STATIC ANALYZERS; VERIFICATION CONDITION; VERIFICATION TOOLS;

FUNCTIONAL PROGRAMMING;

EID: 84937510134     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45653-8_41     Document Type: Conference Paper

References (22)

1. F. Bourdoncle. Abstract Debugging of Higher-Order Imperative Languages. In Programming Languages Design and Implementation'93, pages 46-55, 1993.
2. 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, pages 155-169. Linkoping University, 1997.
3. M. Codish and V. Lagoon. Type Dependencies for Logic Programs using ACI-unification. Journal of Theoretical Computer Science, 238:131-159, 2000.
4. M. Comini, W. Drabent, and P. Pietrzak. Diagnosis of CHIP Programs Using Type Information. In M. C. Meo and M. Vilares Ferro, editors, Appia-Gulp-Prode'99, Joint Conference on Declarative Programming, pages 337-349, 1999.
5. M. Comini, R. Gori, G. Levi, and P. Volpe. Abstract Interpretation based Verification of Logic Programs. In S. Etalle and J.-G. Smaus, editors, Proceedings of the Workshop on Verification of Logic Programs, volume 30 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2000. Available at URL: (http://www.elsevier.nl/locate/entcs/volume30.html).
6. M. Comini, G. Levi, M. C. Meo, and G. Vitiello. Abstract Diagnosis. Journal of Logic Programming, 39(1-3):43-93, 1999.
7. 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 MFPS'97, volume 6 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 1997. Available at URL: (http://www.elsevier.nl/locate/entcs/volume6.html).
8. P. Cousot. Types as abstract interpretations (Invited Paper). In Conference Record of the 24th ACM Symp. on Principles of Programming Languages (POPL'97), pages 316-331. ACM Press, 1997.
9. 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.
10. 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.
11. P. Cousot and R. Cousot. Abstract Interpretation Frameworks. Journal of Logic and Computation, 2(4):511-549, 1992.
12. P. Cousot and R. Cousot. Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation. In M. Bruynooghe and M. Wirsing, editors, Proceedings of PLILP'92, volume 631 of Lecture Notes in Computer Science, pages 269-295. Springer-Verlag, 1992.
13. 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.
14. W. Drabent and J. Maluszynski. Inductive Assertion Method for Logic Programs. Theoretical Computer Science, 59(1):133-155, 1988.
15. W. Drabent and P. Pietrzak. Type Analysis for CHIP. In proceedings of Types for Constraint Logic Programming, post-conference workshop of JICSLP' 98, 1998.
16. J. Gallagher and D. A. De Waal. Regular Approximations of Logic Programs and Their Uses. Technical Report CSTR-92-06, Department of Computer Science, University of Bristol, 1992.
17. J. Gallagher and D. A. De Waal. Fast and Precise Regular Approximations of Logic Programs. In P. Van Hentenryck, editor, Proceedings of the Eleventh International Conference on Logic Programming, pages 599-613, Cambridge, Mass., 1994. MIT Press.
18. 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, 1997.
19. G. Levi and P. Volpe. Derivation of Proof Methods by Abstract Interpretation. In C. Palamidessi, H. Glaser, and K. Meinke, editors, Principles of Declarative Programming. 10th International Symposium, PLILP'98, volume 1490 of Lecture Notes in Computer Science, pages 102-117. Springer-Verlag, 1998.
20. D. Park. Fixpoint Induction and Proofs of Program Properties. Machine Intelligence, 5:59-78, 1969.
21. D. Remy and J. Vouillon. Objective ML: An effective object-oriented extension to ML. Theory and Practice of Object-Systems, 4(1):27-50, 1998.
22. P. Volpe. Derivation of proof methods for logic programs by abstract interpretation. PhD thesis, Dipartimento di Matematica, Universita di Napoli Federico II, 1999.