Counterexample-guided focus

ACM SIGPLAN Notices

Volumn 45, Issue 1, 2010, Pages 249-260

  Podelski, Andreas ^a   Wies, Thomas ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Abstraction Refinement; Data Structures; Predicate Abstraction; Quantified Invariants; Shape Analysis

Indexed keywords

ABSTRACTING; DATA STRUCTURES; EFFICIENCY;

ABSTRACTION REFINEMENT; HEAP-MANIPULATING PROGRAMS; PREDICATE ABSTRACTIONS; PROGRAM STATEMENTS; QUANTIFIED INVARIANTS; SHAPE ANALYSIS; SOFTWARE VERIFICATION; UNIVERSAL QUANTIFIERS;

VERIFICATION;

EID: 77149156662     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1707801.1706330     Document Type: Conference Paper

References (56)

1. T. Ball, B. Cook, S. Das, and S. K. Rajamani. Refining approximations in software predicate abstraction. In TACAS'04, pages 388-403, 2004.
2. T. Ball, A. Podelski, and S. K. Rajamani. Boolean and Cartesian abstraction for model checking C programs. In TACAS'01, pages 268-283, 2001.
3. T. Ball and S. K. Rajamani. The SLAM project: debugging system software via static analysis. In POPL'02, pages 1-3, 2002.
4. J. Berdine, C. Calcagno, B. Cook, D. Distefano, P. O'Hearn, T. Wies, and H. Yang. Shape analysis for composite data structures. In CAV'07, pages 178-192, 2007.
5. D. Beyer, T. A. Henzinger, R. Majumdar, and A. Rybalchenko. Path invariants. In PLDI, pages 300-309, 2007.
6. D. Beyer, T. A. Henzinger, and G. Th́eoduloz. Lazy shape analysis. In CAV'06, pages 532-546, 2006.
7. J. D. Bingham and Z. Rakamaric. A logic and decision procedure for predicate abstraction of heap-manipulating programs. In VMCAI'06, pages 207-221, 2006.
8. I. Bogudlov, T. Lev-Ami, T. W. Reps, and M. Sagiv. Revamping TVLA: Making Parametric Shape Analysis Competitive. In CAV'07, pages 221-225, 2007.
9. A. Bouajjani, P. Habermehl, A. Rogalewicz, and T. Vojnar. Abstract regular tree model checking. ENTCS, 149(1):37-48, 2006.
10. A. Bouajjani, P. Habermehl, A. Rogalewicz, and T. Vojnar. Abstract regular tree model checking of complex dynamic data structures. In SAS'06, pages 52-70, 2006.
11. R. E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. TC, 35(10):677-691, 1986.
12. S. Chaki, E. M. Clarke, A. Groce, S. Jha, and H. Veith. Modular verification of software components in C. In ICSE'03, pages 385- 395, 2003.
13. B.-Y. E. Chang, X. Rival, and G. C. Necula. Shape analysis with structural invariant checkers. In SAS'07, pages 384-401, 2007.
14. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-Guided Abstraction Refinement. In CAV'00, pages 154-169, 2000.
15. 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, 1977.
16. P. Cousot and R. Cousot. Formal language, grammar and setconstraintbased program analysis by abstract interpretation. In FPCA'95, pages 170-181, 1995.
17. S. Das and D. L. Dill. Successive approximation of abstract transition relations. In LICS'01, pages 51-60, 2001.
18. L. de Moura and N. Bjørner. Z3: An Efficient SMT Solver. In TACAS'08, 2008.
19. D. Distefano, P. O'Hearn, and H. Yang. A local shape analysis based on separation logic. In TACAS'06, pages 287-302, 2006. (Pubitemid 44019377)
20. C. Flanagan and S. Qadeer. Predicate abstraction for software verification. In POPL'02, pages 191-202, 2002.
21. D. Gopan, T.W. Reps, and S. Sagiv. A framework for numeric analysis of array operations. In POPL'05, pages 338-350, 2005. [22] S. Graf and H. Saïdi. Construction of Abstract State Graphs with PVS. In CAV'97, pages 72-83, 1997.
22. K. Zee, V. Kuncak, and M. C. Rinard. An integrated proof language for imperative programs. In PLDI'09, pages 338-351, 2009.
23. S. Gulwani, B.McCloskey, and A. Tiwari. Lifting abstract interpreters to quantified logical domains. In POPL'08, pages 235-246, 2008.
24. B. Guo, N. Vachharajani, and D. I. August. Shape analysis with inductive recursion synthesis. In PLDI'07, pages 256-265, 2007.
25. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy Abstraction. In POPL'02, pages 58-70, 2002.
26. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Software verification with BLAST. In SPIN 03: Model Checking of Software, pages 235-239. 2003. (Pubitemid 137635189)
27. R. Jhala and K. L. McMillan. Array abstractions from proofs. In CAV'07, pages 193-206, 2007.
28. N. Klarlund and A. Møller. MONA Version 1.4 User Manual. BRICS Notes Series NS-01-11, University of Aarhus, January 2001.
29. L. Kovacs and A. Voronkov. Finding loop invariants for programs over arrays using a theorem prover. In FASE'09, pages 470-485, 2009.
30. V. Kuncak. Modular Data Structure Verification. PhD thesis, EECS Department, Massachusetts Institute of Technology, February 2007.
31. S. K. Lahiri and R. E. Bryant. Constructing quantified invariants via predicate abstraction. In VMCAI'04, pages 267-281, 2004.
32. S. K. Lahiri and R. E. Bryant. Indexed predicate discovery for unbounded system verification. In CAV'04, 2004.
33. S. K. Lahiri and S. Qadeer. Back to the future: revisiting precise program verification using SMT solvers. In POPL'08, pages 171- 182, 2008.
34. P. Lam, V. Kuncak, and M. Rinard. Hob: A tool for verifying data structure consistency. In CC'05, 2005.
35. T. Lev-Ami. TVLA: A Framework for Kleene Based Logic Static Analyses. Master's thesis, Tel-Aviv University, Israel, 2000.
36. T. Lev-Ami, N. Immerman, and M. Sagiv. Abstraction for shape analysis with fast and precise transformers. In CAV'06, pages 533- 546, 2006.
37. A. Loginov, T. Reps, and M. Sagiv. Abstraction refinement via inductive learning. In CAV'05, 2005.
38. S. Magill, J. Berdine, E. M. Clarke, and B. Cook. Arithmetic strengthening for shape analysis. In SAS'07, pages 419-436, 2007.
39. R. Manevich. Partially Disjunctive Shape Analysis. PhD thesis, Tel-Aviv University, Israel, 2009.
40. R. Manevich, J. Berdine, B. Cook, G. Ramalingam, and M. Sagiv. Shape analysis by graph decomposition. In TACAS'07, pages 3-18, 2007.
41. R. Manevich, M. Sagiv, G. Ramalingam, and J. Field. Partially disjunctive heap abstraction. In SAS'04, pages 265-279, 2004.
42. M. Marron, D. Kapur, D. Stefanovic, and M. V. Hermenegildo. A static heap analysis for shape and connectivity. In LCPC, pages 345-363, 2006.
43. K. L.McMillan. Quantified invariant generation using an interpolating saturation prover. In TACAS'08, volume 4963, pages 413-427, 2008.
44. A. Podelski and A. Rybalchenko. ARMC: the logical choice for software model checking with abstraction refinement. In PADL'07, pages 245-259, 2007.
45. A. Podelski and T. Wies. Boolean Heaps. In SAS'05, pages 267-282, 2005.
46. T. Reps, M. Sagiv, and A. Loginov. Finite differencing of logical formulas for static analysis. In ESOP'03, pages 380-398, 2003.
47. N. Rinetzky, A. Poetzsch-Heffter, G. Ramalingam, M. Sagiv, and E. Yahav. Modular shape analysis for dynamically encapsulated programs. In ESOP'07, pages 220-236, 2007.
48. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. TOPLAS, 24(3):217-298, 2002.
49. M. N. Seghir, A. Podelski, and T. Wies. Abstraction refinement for quantified array assertions. In SAS'09, 2009.
50. S. Srivastava and S. Gulwani. Program verification using templates over predicate abstraction. In PLDI'09, 2009.
51. T.Wies. Symbolic Shape Analysis. PhD thesis, University of Freiburg, Freiburg, Germany, 2009.
52. T. Wies, V. Kuncak, P. Lam, A. Podelski, and M. Rinard. Field Constraint Analysis. In VMCAI'06, 2006.
53. H. Yang, O. Lee, J. Berdine, C. Calcagno, B. Cook, D. Distefano, and P. W. O'Hearn. Scalable shape analysis for systems code. In CAV'08, pages 385-398, 2008.
54. G. Yorsh, A. M. Rabinovich, M. Sagiv, A. Meyer, and A. Bouajjani. A Logic of Reachable Patterns in Linked Data-Structures. In FOSSACS'06, pages 94-110, 2006.
55. G. Yorsh, T. Reps, and M. Sagiv. Symbolically computing mostprecise abstract operations for shape analysis. In TACAS'04, 2004.
56. K. Zee, V. Kuncak, and M. Rinard. Full Functional Verification for Linked Data Structures. In PLDI'08, pages 349-361, 2008.