Shape analysis by graph decomposition

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

Volumn 4424 LNCS, Issue , 2007, Pages 3-18

  Manevich, R ^a   Berdine, J ^c   Cook, B ^c   Ramalingam, G ^b   Sagiv, M ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b MICROSOFT RESEARCH INDIA   (India)

^c MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CORRELATION METHODS; DATA STRUCTURES; GRAPH THEORY; VERIFICATION; ABSTRACTING;

GRAPH DECOMPOSITION; SHAPE ANALYSIS; SUBGRAPHS; GRAPH DECOMPOSITIONS; LINKED DATA STRUCTURES; SAFETY PROPERTY;

COMPUTER SOFTWARE; DATA STRUCTURES;

EID: 37149003778     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71209-1_3     Document Type: Conference Paper

References (18)

1. D. R. Chase, M. Wegman, and F. Zadeck. Analysis of pointers and structures. In Proc. Conf. on Prog. Lang. Design and Impl., New York, NY, 1990. ACM Press.
2. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Los Angeles, California, 1977. ACM Press, New York, NY.
3. D. Distefano, P. W. O'Hearn, and H. Yang. A local shape analysis based on separation logic. In In Proc. 13th Intern. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'06), 2006.
4. M. R. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.
5. A. Gotsman, J. Berdine, and B. Cook. Interprocedural shape analysis with separated heap abstractions. In Proceedings of the 13th International Static Analysis Symposium (SAS'06), 2006.
6. B. Hackett and R. Rugina. Region-based shape analysis with tracked locations. In Proc. Symp. on Principles of Prog. Languages, 2005.
7. N. D. Jones and S. S. Muchnick. Complexity of flow analysis, inductive assertion synthesis, and a language due to dijkstra. In Program Flow Analysis: Theory and Applications, chapter 12. Prentice-Hall, Englewood Cliffs, NJ, 1981.
8. N. D. Jones and S. S. Muchnick. Flow analysis and optimization of Lisp-like structures, In S. S. Muchnick and N. D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 4. Prentice-Hall, Englewood Cliffs, NJ, 1981.
9. T. Lev-Ami, N. Immerman, and M. Sagiv. Abstraction for shape analysis with fast and precise transformers. In CAV, 2006.
10. T. Lev-Ami and M. Sagiv. TVLA: A system for implementing static analyses. In Proc. Static Analysis Symp., 2000.
11. R. Manevich, J. Berdine, B. Cook, G. Ramalingam, and M. Sagiv. Shape analysis by graph decomposition. 2006. Full version.
12. R. Manevich, M. Sagiv, G. Ramalingam, and J. Field. Partially disjunctive heap abstraction. In Proceedings of the 11th International Symposium, SAS 2004, Lecture Notes in Computer Science. Springer, August 2004.
13. R. Manevich, E. Yahav, G. Ramalingam, and M. Sagiv. Predicate abstraction and canonical abstraction for singly-linked lists. In Proceedings of the 6th International Conference on Verification, Model Checking and Abstract Interpretation, VMCAI 2005. Springer, January 2005.
14. N. Rinetzky, J. Bauer, T. Reps, M. Sagiv, and R. Wilhelm. A semantics for procedure local heaps and its abstractions. In 32nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'05), 2005.
15. N. Rinetzky, M. Sagiv, and E. Yahav. Interprocedural shape analysis for cutpointfree programs. In 12th International Static Analysis Symposium (SAS), 2005.
16. M. Sagiv, T. Reps, and R. Wilhelm. Solving shape-analysis problems in languages with destructive updating. ACM Transactions on Programming Languages and Systems, 20(1), January 1998.
17. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems, 2002.
18. E. Yahav and G. Ramalingam. Verifying safety properties using separation and heterogeneous abstractions. In Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation, 2004.