Automatic verification based on abstract interpretation

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

Volumn 1722, Issue , 1999, Pages 131-146

  Ogawa, Mizuhito ^a  

^a NTT Communication Science Laboratories   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER CIRCUITS; FUNCTIONAL PROGRAMMING; MODEL CHECKING; SPECIFICATION LANGUAGES; SPECIFICATIONS;

ABSTRACT INTERPRETATIONS; AUTOMATIC VERIFICATION; RECURSIVE DATA STRUCTURES;

LOGIC PROGRAMMING;

EID: 84957620785     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10705424_9     Document Type: Conference Paper

References (24)

1. S. Abramsky and C. Hankin, editors. Abstract interpretation of declarative languages. Ellis Horwood Limited, 1987. 132, 136
2. T. Arts and J. Gisel. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 1999. to appear. 131
3. P.N. Benton. Strictness properties of lazy algebraic datatypes. In Proc. 3rd WSA, pages 206-217, 1993. Springer LNCS 724. 132, 145
4. F. Bourdoncle. Abstract debugging of higher-order imperative programs. In ACM SIGPLAN PLDI 1993, pages 46-55, 1993. 144
5. F. Bourdoncle. Assertion-based debugging of imperative programs by abstract interpretation. In 4th ESEC, pages 501-516, 1993. Springer LNCS 717. 144
6. F. Bueno et al. On the role of semantic approximations in validation and diagnosis of constraint logic programs. In Proc. AADEBUG '97, pages 155-169, 1997. 144
7. G.L. Burn. Lazy Functional Languages: Abstract Interpretation and Compilation. The MIT Press, 1991. 132, 136
8. 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 LNCS, pages 22-50. Springer-Verlag, 1996. 144
9. A. Cortesi, G. Filé, and W. Winsborough. Prop revisited: Propositional formula as abstract domain for groundness analysis. In Proc. 6th LICS, pages 322-327, 1991. 145
10. A. Cortesi, B. Le Charlier, and S. Rossi. Specification-based automatic verification of Prolog programs. In Proc. LOPSTR '96, pages 38-57, 1996. Springer LNCS 1207. 144
11. th ACM POPL, pages 238-252, 1977. 132, 136
12. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 6, pages 243-320. Elsevier Science Publishers, 1990. 131
13. D. Detlefs and R. Forgaard. A procedure for automatically proving the termination of a set of rewrite rules. In Proc. 1st RTA, pages 255-270, 1985. Springer LNCS 202. 131
14. P. Dybjer. Inverse image analysis generalizes strictness analysis. Information and Computation, 90(2):194-216, 1991. 144
15. th ICALP, pages 47-59, 1991. Springer LNCS 510. 132, 145
16. J. Gisel. Termination of nested and mutually recursive algorithms. Journal of Automated Reasoning, 19:1-29, 1997. 131
17. T.P. Jensen. Abstract interpretation over algebraic data types. In Proc. Int. Conf. on Computer Languages, pages 265-276. IEEE, 1994. 132, 145
18. B. Le Charlier, C. Leclère, S. Rossi, and A. Cortesi. Automatic verification of behavioral properties of Prolog programs. In Proc. ASIAN '97, pages 225-237, 1997. Springer LNCS 1345. 144
19. D. Le Métayer. Proving properties of programs defined over recursive data structures. In Proc. ACM PEPM '95, pages 88-99, 1995. 131, 132, 136, 144, 145
20. G. Levi and P. Volpe. Derivation of proof methods by abstract interpretation. In ALP'98, pages 102-117, 1998. Springer LNCS 1490. 144
21. M. Ogawa and S. Ono. Deriving inductive properties of recursive programs based on least-fixpoint computation. Journal of Information Processing, 32(7):914-923, 1991. in Japanese. 132, 145
22. M. Ogawa and S. Ono. Transformation of strictness-related analyses based on abstract interpretation. IEICE Trans., E 74(2):406-416, 1991. 144
23. nd edition, 1996. 145
24. V. Van Oostrom. Confluence for Abstract and Higher-Order Rewriting. PhD thesis, Vrije universiteit, Amsterdam, 1994. 138