Specialized 3-valued logic shape analysis using structure-based refinement and loose embedding

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

Volumn 4134 LNCS, Issue , 2006, Pages 204-220

  Arnold, Gilad ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; DATA REDUCTION; OPTIMIZATION;

COMBINATORIAL FACTORS; REFERENCE IMPLEMENTATION; SHAPE ANALYSIS;

FORMAL LOGIC;

EID: 33749840533     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11823230_14     Document Type: Conference Paper

References (12)

1. G. Arnold. Lightweight specialized 3-valued logic shape analyzer. Technical Report UCB/EECS-2006-59, EECS Department, University of California, Berkeley, May 2006. Available at http://www.eecs.berkeley.edu/Pubs/TechRpts/ 2006/EECS-2006-59.html.
2. G. Arnold, R. Manevich, M. Sagiv, and R. Shaham. Intersecting heap abstractions with applications to compile-time memory management. Technical Report TR-2005-04-135520, Tel-Aviv University, Apr. 2005. Available at http://www.cs.tau.ac.il/~rumster/TR-2005-04-135520.pdf.
3. G. Arnold, R. Manevich, M. Sagiv, and R. Shaham. Combining shape analyses by intersecting abstractions. In Verification, Model Checking and Abstract Interpretation (VMCAI), volume 3855, pages 33-48. Springer-Verlag, 2006.
4. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Symposium on Principals of Programming Languages (POPL), pages 269-282. ACM Press, 1979.
5. S. K. Lahiri and S. Qadeer. Verifying properties of well-founded linked lists. In Symposium on Principals of Programming Languages (POPL), pages 115-126, 2006.
6. O. Lee, H. Yang, and K. Yi. Automatic verification of pointer programs using grammar-based shape analysis. In The European Symposium on Programming (ESOP), volume 3444, pages 124-140. Springer-Verlag, 2005.
7. T. Lev-Ami. TVLA: A framework for kleene logic based static analysis. Master's thesis, Tel-Aviv University, May 2000.
8. T. Lev-Ami, T. W. Reps, M. Sagiv, and R. Wilhelm. Putting static analysis to work for verification: A case study. In International Symposium on Software Testing and Analysis (ISSTA), pages 26-38, 2000.
9. T. Lev-Ami and M. Sagiv. TVLA: A system for implementing static analyses. In Static Analysis Symposium (SAS), pages 280-301, 2000.
10. R. Manevich, M. Sagiv, G. Ramalingam, and J. Field. Partially disjunctive heap abstraction. In Static Analysis Symposium (SAS), pages 265-279, 2004.
11. R. Manevich, E. Yahav, G. Ramalingam, and M. Sagiv. Predicate abstraction and canonical abstraction for singly-linked lists. In Verification, Model Checking and Abstract Interpretation (VMCAI), pages 181-198, 2005.
12. M. Sagiv, T. W. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. Transactions on Programming Languages and Systems (TOPLAS), 24(3):217-298, 2002.