Compositional shape analysis by means of bi-abduction

ACM SIGPLAN Notices

Volumn 44, Issue 1, 2009, Pages 289-300

  Calcagno, Cristiano ^a   Distefano, Dino ^b   O'Hearn, Peter ^b   Yang, Hongseok ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Abduction; Program analysis; Proof theory

Indexed keywords

COMPUTER OPERATING SYSTEMS; INVERSE PROBLEMS;

ABDUCTION; ABSTRACT DOMAINS; ANALYSIS ALGORITHMS; INTER-PROCEDURAL ANALYSIS; LINUX DISTRIBUTIONS; PROGRAM ANALYSIS; PROOF THEORY; SEPARATION LOGIC;

QUALITY CONTROL;

EID: 70350303365     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1594834.1480917     Document Type: Conference Paper

References (45)

1. P.A. Abdulla, A. Bouajjani, J. Cederberg, F. Haziza, A. Rezine: Monotonic Abstraction for Programs with Dynamic Memory Heaps. In CAV'08, pp. 341-354.
2. A.Podelski, A.Rybalchenko, and T.Wies. Heap assumptions on demand. In CAV, 2008.
3. I. Balaban, A. Pnueli, and L. D. Zuck. Shape analysis by predicate abstraction. In VMCAI'05, pp. 164-180.
4. J. Berdine, C. Calcagno, B. Cook, D. Distefano, P. O'Hearn, T. Wies, and H. Yang. Shape analysis of composite data structures. In CAV'07.
5. J. Berdine, C. Calcagno, and P. O'Hearn. Symbolic execution with separation logic. In APLAS'05, pp. 52-68.
6. A. Bouajjani, P. Habermehl, A. Rogalewicz, and T. Vojnar. Abstract tree regular model checking of complex dynamic data structures. In SAS'06, pp. 52-70.
7. C. Calcagno, D. Distefano, P. O'Hearn, and H. Yang. Footprint analysis: A shape analysis that discovers preconditions. In SAS'07.
8. B. Chang and X. Rival. Relational inductive shape analysis. In POPL'08, pp. 247-260.
9. B. Chang, X. Rival, and G. Necula. Shape analysis with structural invariant checkers. In SAS'07, pp. 384-401.
10. P. Cousot and R. Cousot. Compositional separate modular static analysis of programs by abstract interpretation. In SSGRR'01.
11. D. Distefano, P. O'Hearn, and H. Yang. A local shape analysis based on separation logic. In TACAS'06, pp. 287-302.
12. D. Distefano and M. Parkinson. jStar: Towards Practical Verification for Java. In OOPSLA'08, pp. 213-226.
13. N. Dor, M. Rodeh, and M. Sagiv. CSSV: Towards a realistic tool for statically detecting all buffer overflows in C. In PLDI'03, pp. 155-167.
14. R. Ghiya and . Hendren. Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C. In POPL'96, pp. 1-15.
15. R. Giacobazzi. Abductive analysis of modular logic programs. In SLP'94, pp. 377-392.
16. D. Gopan and T. Reps. Low-level library analysis and summarization. In CAV'07, pp. 68-81.
17. A. Gotsman, J. Berdine, and B. Cook. Interprocedural shape analysis with separated heap abstractions. In SAS'06, pp. 240-260.
18. A. Gotsman, J. Berdine, B. Cook, and M. Sagiv. Thread-modular shape analysis In PLDI'07, pp. 266-277.
19. S. Gulwani, B. McCloskey, and A. Tiwari. Lifting Abstract Interpreters to Quantified Logical Domains. In POPL'08, pp. 235-246.
20. S. Gulwani and A. Tiwari. Computing procedure summaries for interprocedural analysis. In ESOP'07, pp. 253-267.
21. B. Guo, N. Vachharajani, and D. August. Shape analysis with inductive recursion synthesis. In PLDI'07, pp. 256-265.
22. B. Hackett and R. Rugina. Region-based shape analysis with tracked locations. In POPL'05, pp. 310-323.
23. H.Yang, O.Lee, J.Berdine, C.Calcagno, B.Cook, D.Distefano, and P.O'Hearn. Scalable shape analysis for systems code. In CAV'08.
24. A. C. Kakas, R. A. Kowalski, and F. Toni. Abductive logic programming. J. of Logic and Computation, 2(6):719-770, 1992.
25. V. Kuncak, P. Lam, and M. Rinard. Role analysis. In POPL'02.
26. T. Lev-Ami, N. Immerman, and M. Sagiv. Abstraction for shape analysis with fast and precise transfomers. In CAV'06, pp. 547-561.
27. T. Lev-Ami, M. Sagiv, T. Reps, and S. Gulwani:. Backward analysis for inferring quantified preconditions. Tel Aviv University Tech Report TR-2007-12-101, 2007.
28. S. Magill, J. Berdine, E. Clarke, and B. Cook. Arithmetic Strengthening for Shape Analysis. In SAS'07, pp. 419-436.
29. R. Manevich, J. Berdine, B. Cook, G. Ramalingam, and M. Sagiv. Shape analysis by graph decomposition. In TACAS'07, pp. 3-18.
30. M. Marron, M. Hermenegildo, D. Kapur, and D. Stefanovic. Efficient context-sensitive shape analysis with graph based heap models. In CC'08, pp. 245-259.
31. Y. Moy. Sufficient preconditions for modular assertion checking. In VMCAI'08, pp. 188-202.
32. H. Nguyen, C. David, S. Qin, andW.-N. Chin. Automated verification of shape and size properties via separation logic. In VMCAI'07.
33. E. Nystrom, H. Kim, and W. Hwu. Bottom-up and top-down contextsensitive summary-based pointer analysis. SAS'04, pp. 165-180.
34. P. O'Hearn, J. Reynolds, and H. Yang. Local reasoning about programs that alter data structures. In CSL'01, pp. 1-19.
35. P. O'Hearn, H. Yang and J. Reynolds. Separation and information hiding. In POPL'04, pp. 268-280.
36. C. Peirce. Collected papers of Charles Sanders Peirce. Harvard University Press., 1958.
37. A. Podelski and T. Wies. Boolean heaps. In SAS'05, pp. 268-283.
38. A.Podelski, A.Rybalchenko, and T.Wies. Heap assumptions on demand. In CAV'08, pp. 314-327.
39. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In POPL'95, pp. 49-61.
40. J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In LICS'02, pp. 55-74.
41. N. Rinetzky, J. Bauer, T. Reps, M. Sagiv, and R.Wilhelm. A semantics for procedure local heaps and its abstractions. In POPL'05.
42. N. Rinetzky, M. Sagiv, and E. Yahav. Interprocedural shape analysis for cutpoint-free programs. In SAS'05, pp. 284-302.
43. M. Sagiv, T. Reps, R. Wilhelm. Solving shape-analysis problems in languages with destructive updating. ACM TOPLAS, 20(1):1-50,1998.
44. M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In S. Muchnick and J. Jones, editors, Program Flow Analysis: Theory and Applications. Prentice-Hall, 1981.
45. J. Whaley and M. Rinard. Compositional pointer and escape analysis for Java. In OOPSLA'06, pp. 187-206.