Shape refinement through explicit heap analysis

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

Volumn 6013 LNCS, Issue , 2010, Pages 263-277

  Beyer, Dirk ^a,b   Henzinger, Thomas A ^c   Théoduloz, Grégory ^d   Zufferey, Damien ^c  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF PASSAU   (Germany)

^c INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

^d EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTION REFINEMENT; AUTOMATIC VERIFICATION; INFEASIBLE PATHS; PROGRAM PROPERTIES; SHAPE ANALYSIS; SHAPE REFINEMENT; SOFTWARE MODEL CHECKERS; STEPWISE APPROACH; STRUCTURE TYPE;

ABSTRACTING; COMPUTER SOFTWARE SELECTION AND EVALUATION; DATA STRUCTURES; MODEL CHECKING; SOFTWARE ENGINEERING;

TREES (MATHEMATICS);

EID: 77951292292     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12029-9_19     Document Type: Conference Paper

References (18)

1. Ball, T., Rajamani, S.K.: The SLAM project: Debugging system software via static analysis. In: Proc. POPL, pp. 1-3. ACM, New York (2002)
2. Beckman, N., Nori, A.V., Rajamani, S.K., Simmons, R.J.: Proofs from tests. In: Proc. ISSTA, pp. 3-14. ACM, New York (2008)
3. Beyer, D., Henzinger, T.A., Jhala, R., Majumdar, R.: The software model checker BLAST. Int. J. Softw. Tools Technol. Transfer 9(5-6), 505-525 (2007)
4. Beyer, D., Henzinger, T.A., Théoduloz, G.: Lazy shape analysis. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 532-546. Springer, Heidelberg (2006)
5. Beyer, D., Henzinger, T.A., Théoduloz, G.: Program analysis with dynamic precision adjustment. In: Proc. ASE, pp. 29-38. IEEE, Los Alamitos (2008)
6. Chaki, S., Clarke, E.M., Groce, A., Jha, S., Veith, H.: Modular verification of software components in C. IEEE Trans. Softw. Eng. 30(6), 388-402 (2004)
7. Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50(5), 752-794 (2003)
8. Gulavani, B.S., Henzinger, T.A., Kannan, Y., Nori, A.V., Rajamani, S.K.: SYNERGY: A new algorithm for property checking. In: Proc. FSE, pp. 117-127. ACM, New York (2006)
9. Gulavani, B.S., Rajamani, S.K.: Counterexample-driven refinement for abstract interpretation. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 474-488. Springer, Heidelberg (2006)
10. Gupta, A., Majumdar, R., Rybalchenko, A.: From tests to proofs. In: Kowalewski, S., Philippou, A. (eds.) ACAS 2009. LNCS, vol. 5505, pp. 262-276. Springer, Heidelberg (2009)
11. Henzinger, T.A., Jhala, R., Majumdar, R., McMillan, K.L.: Abstractions from proofs. In: Proc. POPL, pp. 232-244. ACM Press, New York (2004)
12. Kröning, D., Groce, A., Clarke, E.M.: Counterexample-guided abstraction refinement via program execution. In: Davies, J., Schulte, W., Barnett, M. (eds.) ICFEM 2004. LNCS, vol. 3308, pp. 224-238. Springer, Heidelberg (2004)
13. Loginov, A., Reps, T.W., Sagiv, M.: Abstraction refinement via inductive learning. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 519-533. Springer, Heidelberg (2005)
14. McMillan, K.L.: Interpolation and SAT-based model checking. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 1-13. Springer, Heidelberg (2003)
15. Reps, T.W., Horwitz, S., Sagiv, M.: Precise interprocedural data-flow analysis via graph reachability. In: Proc. POPL, pp. 49-61. ACM, New York (1995)
16. Rinetzky, N., Sagiv, M., Yahav, E.: Interprocedural functional shape analysis using local heaps. Technical Report TAU-CS-26/04, Tel-Aviv University (2004)
17. Sagiv, M., Reps, T.W., Wilhelm, R.: Parametric shape analysis via 3-valued logic. ACM Trans. Program. Lang. Syst. 24(3), 217-298 (2002)
18. Yorsh, G., Ball, T., Sagiv, M.: Testing, abstraction, theorem proving: Better together! In: Proc. ISSTA, pp. 145-156. ACM, New York (2006)