An experiment in type inference and verification by abstract interpretation

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

Volumn 2294 LNCS, Issue , 2002, Pages 225-239

  Gori, Roberta ^a   Levi, Giorgio ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; INFERENCE ENGINES; SEMANTICS;

ABSTRACT INTERPRETATION TECHNIQUES; ABSTRACT INTERPRETATIONS; COMPLEX TYPE SYSTEMS; FIXPOINT COMPUTATIONS; FUNCTIONAL LANGUAGES; POLYMORPHIC RECURSION; TYPE INFERENCE ALGORITHM; VERIFICATION METHOD; ABSTRACT SEMANTICS;

MODEL CHECKING;

EID: 35248892724     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47813-2_16     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, 1997.
3. M. Comini, R. Gori, and G. Levi. How to Transform an Analyzer into a Verifier. In R. Nieuwenhuis and A. Voronkov, editors, Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, volume 2250 of Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin, 2001.
4. 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.
5. M. Comini, G. Levi, M. C. Meo, and G. Vitiello. Abstract Diagnosis. Journal of Logic Programming, 39(1-3):43-93, 1999.
6. G. Cousineau and M. Mauny. The Functional Approach to Programming. Cambridge University Press, 1998.
7. P. Cousot. Types as abstract interpretations. In Conference Record of the 24th ACM Symp. on Principles of Programming Languages, pages 316-331. ACM Press, 1997.
8. 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.
9. 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.
10. P. Cousot and R. Cousot. Abstract Interpretation Frameworks. Journal of Logic and Computation, 2(4):511-549, 1992.
11. 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.
12. 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.
13. L. Damas and R. Milner. Principal type-schemes for functional programs. In Proceedings of the Ninth Annual ACM Symposium on Principles of Programming Languages, pages 207-212. ACM Press, 1982.
14. G. Filè, R. Giacobazzi, and F. Ranzato. A Unifying View on Abstract Domain Design. ACM Computing Surveys, 28(2):333-336, 1996.
15. J.R. Hindley. The principal type-scheme of an object in combinatory logic. Transaction American mathematical Society, 146:29-60, 1969.
16. 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.
17. R. Milner. A theory of type polymorphism in programming. Journal of Computer and Systems Sciences, 17-3:348-375, 1978.
18. B. Monsuez. Polymorphic typing by abstract interpretation. In R. Shyamasundar, editor, Proceedings of Foundation of Software Technology and Theoretical Computer Science, volume 652 of Lecture Notes in Computer Science, pages 217-228. Springer-Verlag, 1992.
19. B. Monsuez. Polymorphic types and widening operators. In P.Cousot, M.Falaschi, G. File', and A.Rauzy, editors, Proceedings of Static Analysis, volume 724 of Lecture Notes in Computer Science, pages 224-281. Springer-Verlag, 1993.
20. A. Mycroft. Polymorphic type schemes and recursive definitions. In G. Goos and J. Hartmanis, editors, Proceedings of the International Symposium on Programming, volume 167 of Lecture Notes in Computer Science, pages 217-228. Springer-Verlag, 1984.
21. D. Park. Fixpoint Induction and Proofs of Program Properties. Machine Intelligence, 5:59-78, 1969.
22. D. Rémy and J. Vouillon. Objective ML:An effective object-oriented extension to ML. Theory and Practice of Object-Systems, 4(1):27-50, 1998.