Boolean heaps

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

Volumn 3672 LNCS, Issue , 2005, Pages 268-283

  Podelski, Andreas ^a   Wies, Thomas ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; CODES (SYMBOLS); COMPUTER PROGRAMMING; SET THEORY;

BOOLEAN STATES; DEDUCTIVE REASONING; HEAP OBJECTS;

ABSTRACTING;

EID: 33646065057     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11547662_19     Document Type: Conference Paper

References (16)

1. I. Balaban, A. Pnueli, and L. Zuck. Shape Analysis by Predicate Abstraction. In Verification, Model Checking and Abstract Interpretation (VMCAI'05), LNCS 3385, pages 164-180. Springer, 2005.
2. T. Ball, R. Majumdar, T. Millstein, and S. Rajamani. Automatic predicate abstraction of C programs. In Programming language design and implementation (PLDI'01), volume 36 of ACM SIGPLAN Notices, pages 203-213, 2001.
3. T. Ball, A. Podelski, and S. Rajamani. Boolean and Cartesian abstraction for model checking C programs. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS'01), LNCS 2031, pages 268-283. Springer, 2001.
4. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Symposium on Principles of Programming Languages (POPL'79), pages 269-282, 1979.
5. D. Dams and K. Namjoshi. Shape Analysis through Predicate Abstraction and Model Checking. In Verification, Model Chucking and Abstract Interpretation (VM-CAI'03), LNCS 2575, pages 310-323. Springer, 2003.
6. S. Graf and H. Saïdi. Construction of Abstract State Graphs with PVS. In Orna Grumberg, editor, Computer Aided Verification (CAV'97), LNCS 1254, pages 72-83. Springer, 1997.
7. N. Immerman, A. Rabinovich, T. Reps, M. Sagiv, and G. Yorsh. The Boundary Between Decidability and Undecidability for Transitive-Closure Logics. In Computer Science Logic (CSL 2004), LNCS 3210, pages 160-174. Springer, 2004.
8. N. Immerman, A. Rabinovich, T. Reps, M. Sagiv, and G. Yorsh. Verification Via Structure Simulation. In Computer Aided Verification (CAV'04), LNCS 3114, pages 281-294. Springer, 2004.
9. N. Klarlund and M. Schwartzbach. Graph types. In Symposium on Principles of Programming Languages (POPL'93), pages 196-205, 1993.
10. V. Kuncak and M. Rinard. Boolean Algebra of Shape Analysis Constraints. In Verification, Model Checking and Abstract Interpretation (VMCAI'04), LNCS 2937, pages 59-72. Springer, 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'05), LNCS 3385, pages 181-198. Springer, 2005.
12. A. Møller and M. Schwartzbach. The pointer assertion logic engine. In Programming language design and implementation (PLDI'01), pages 221-231, 2001.
13. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems (TOPLAS), 24(3):217-298, 2002.
14. T. Wies. Symbolic Shape Analysis. Diploma thesis, Universität des Saarlandes, Saarbrücken, Germany, 2004.
15. G. Yorsh. Logical Characterizations of Heap Abstractions. Master's thesis, Tel-Aviv University, Tel-Aviv, Israel, 2003.
16. G. Yorsh, T. Reps, and M. Sagiv. Symbolically Computing Most-Precise Abstract Operations for Shape Analysis. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS'04), LNCS 2988, pages 530-545. Springer, 2004.