Lazy shape analysis

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

Volumn 4144 LNCS, Issue , 2006, Pages 532-546

  Beyer, Dirk ^a   Henzinger, Thomas A ^a   Théoduloz, Grégory ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTATIONAL METHODS; DATA STORAGE EQUIPMENT; DATA STRUCTURES; GRAPH THEORY; INTEGRATED CIRCUIT LAYOUT; RECURSIVE FUNCTIONS;

POINTER STRUCTURES; PREDICATE ABSTRACTION; SHAPE GRAPHS; SOFTWARE MODEL CHECKERS;

COMPUTER SOFTWARE;

EID: 33749852994     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817963_48     Document Type: Conference Paper

References (20)

1. I. Balaban, A. Pnueli, and L.D. Zuck. Shape analysis by predicate abstraction. In Proc. VMCAI, LNCS 3385, pages 164-180. Springer, 2005.
2. T. Ball and S.K. Rajamani. The SLAM project: Debugging system software via static analysis. In Proc. POPL, pages 1-3. ACM, 2002.
3. D. Beyer, T.A. Henzinger, and G. Théoduloz. Lazy shape analysis. Technical Report MTC-REPORT-2005-006, EPFL, 2005.
4. S. Chaki, E.M. Clarke, A. Groce, S. Jha, and H. Veith, Modular verification of software components in C. IEEE Trans. Software Eng., 30(6):388-402, 2004.
5. D.R. Chase, M.N. Wegman, and F.K. Zadeck. Analysis of pointers and structures. In Proc. PLDI, pages 296-310. ACM, 1990.
6. E.M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In Proc. CAV, LNCS 1855, pages 154-169. Springer, 2000.
7. D. Dams and K.S. Namjoshi. Shape analysis through predicate abstraction and model checking. In Proc. VMCAI, LNCS 2575, pages 310-324. Springer, 2003.
8. J. Fischer, R. Jhala, and R. Majumdar. Joining data flow with predicates. In Proc. FSE, pages 227-236. ACM, 2005.
9. D. Gopan, T.W. Reps, and M. Sagiv. A framework for numeric analysis of array operations. In Proc. POPL, pages 338-350. ACM, 2005.
10. B.S. Gulavani and S.K. Rajamani. Counterexample-driven refinement for abstract interpretation. In Proc. TACAS, LNCS 3920, pages 474-488. Springer, 2006.
11. T.A. Henzinger, R. Jhala, R. Majumdar, and K.L. McMillan. Abstractions from proofs. In Proc. POPL, pages 232-244. ACM, 2004.
12. T.A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In Proc. POPL, pages 58-70. ACM, 2002.
13. N.D. Jones and S.S. Muchnick. A flexible approach to interprocedural data-flow analysis and programs with recursive data structures. In Proc. POPL, pages 66-74. ACM, 1982.
14. R.P. Kurshan. Computer-Aided Verification of Coordinating Processes. Princeton University Press, 1994.
15. T. Lev-Ami, T.W. Reps, M. Sagiv, and R. Wilhelm. Putting static analysis to work for verification: A case study. In Proc. ISSTA, pages 26-38. ACM, 2000.
16. T. Lev-Ami and M. Sagiv. TVLA: A system for implementing static analyses. In Proc. SAS, LNCS 2280, pages 280-301. Springer, 2000.
17. A. Loginov, T.W. Reps, and M. Sagiv. Abstraction refinement via inductive learning, In Proc. CAV, LNCS 3576, pages 519-533. Springer, 2005.
18. K.L. McMillan. Interpolation and SAT-based model checking. In Proc. CAV, LNCS 2725, pages 1-13. Springer, 2003.
19. M. Sagiv, T.W. Reps, and R. Wilhelm. Parametric shape analysis via three-valued logic. ACM Trans. Program. Lang. Syst., 24(3):217-298, 2002.
20. G. Yorsh, T.W. Reps, M. Sagiv, and R. Wilhelm. Logical characterizations of heap abstractions. A CM Trans. Comput. Log., to appear.