Abstracting call-stacks for interprocedural verification of imperative programs

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

Volumn 3116, Issue , 2004, Pages 258-273

  Jeannet, Bertrand ^a,b   Serwe, Wendelin ^a,b  

^a CAMPUS DE BEAULIEU   (France)

^b INRIA RHÔNE ALPES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS; SOFTWARE ENGINEERING;

ABSTRACT INTERPRETATIONS; ADDITIONAL FLEXIBILITIES; CORRECTNESS PROOFS; EFFECTIVE ANALYSIS; FUNCTIONAL APPROACH; IMPERATIVE PROGRAMS; INTER-PROCEDURAL ANALYSIS; OPERATIONAL SEMANTICS;

ABSTRACTING;

EID: 35048824791     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27815-3_22     Document Type: Article

References (28)

1. T. Ball and S. K. Rajamani. Bebop: A symbolic model checker for boolean programs. In SPIN 2000 Workshop, LNCS 1885, pages 113-130. Springer, 2000.
2. A. Bouajjani, J. Esparza, and T. Touili. A generic approach to the static analysis of concurrent programs with procedures. In POPL'03, pages 62-73. ACM, 2003.
3. F. Bourdoncle. Interprocedural abstract interpretation of block structured languages with nested procedures, aliasing and recursivity. In PLILP'90, LNCS 456, pages 307-323. Springer, 1990.
4. F. Bourdoncle. Assertion-based debugging of imperative programs by abstract interpretation. In ESEC'93, LNCS 717, pages 501-516. Springer, 1993.
5. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In POPL'77, pages 238-252. ACM, 1977.
6. P. Cousot and R. Cousot. Static determination of dynamic properties of recursive procedures. In Formal Description of Programming Concepts, pages 237-277. North Holland, 1977.
7. P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. Journal of Logic Programming, 13(2-3), 1992.
8. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In POPL'78, pages 84-97. ACM, 1978.
9. B. Creusillet and F. Irigoin. Interprocedural array region analyses. International Journal of Parallel Programming, 24(6), 1996.
10. A. Deutsch. Interprocedural may-alias analysis for pointers: Beyond fc-limiting. In PLDI'94, pages 230-241. ACM, 1994.
11. J. Esparza and J. Knoop. An automata-theoretic approach to interprocedural dataflow analysis. In FoSSaCS'99, LNCS 1578, pages 14-30. Springer, 1999.
12. J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. In CAV.'01, LNCS 2102, pages 324-336. Springer, 2001.
13. J. Feret. Abstract interpretation-based static analysis of mobile ambients. In SAS'01, LNCS 2126, pages 412-430. Springer, 2001.
14. F. Gaucher, E. Jahier, B. Jeannet, and F. Maraninchi. Automatic state reaching for debugging reactive programs. In AADEBUG'03, 2003.
15. B. Jeannet. Dynamic partitioning in linear relation analysis. Application to the verification of reactive systems. Formal Methods in System Design, 23(1), 2003.
16. B. Jeannet and W. Serwe. Abstracting call-stacks for interprocedural verification of imperative programs. Research Report 4904, INRIA, July 2003.
17. T. Jensen and F. Spoto. Class analysis of object-oriented programs through abstract interpretation. In FoSSaCS'01, LNCS 2030, pages 261-275. Springer, 2001.
18. N. D. Jones and S. S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In POPL '82. ACM, 1982.
19. J. Knoop and B. Steffen. The interprocedural coincidence theorem. In CC'92, LNCS 641, pages 125-140. Springer, 1992.
20. A. Miné. The octagon abstract domain. In AST 2001 in WCRE 2001, pages 310319. IEEE, 2001.
21. th Hungarian Computer Science Conference, 1985.
22. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In POPL'95, pages 49-61. ACM, 1995.
23. T. Reps, S. Schwoon, and S. Jha. Weighted pushdown systems and their application to interprocedural dataflow analysis. In SAS'03, LNCS 2694. Springer, 2003.
24. N. Rinetzky and M. Sagiv. Interprocedural shape analysis for recursive programs. In CC'01, LNCS 2027, pages 133-149. Springer, 2001.
25. V. Rusu, L. du Bousquet, and T. Jéron. An approach to symbolic test generation. In IFM'00, LNCS 1945, pages 338-357. Springer, 2000.
26. M. Sagiv, T. Reps, and S. Horwitz. Precise interprocedural dataflow analysis with applications to constant propagation. TCS, 167(1-2):131-170, 1996.
27. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM ToPLaS, 24(3), 2002.
28. M. Sharir and A. Pnueli. Semantic foundations of program analysis. In S. Muchnick and N. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 7. Prentice Hall, 1981.