Shape analysis of single-parent heaps

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

Volumn 4349 LNCS, Issue , 2007, Pages 91-105

  Balaban, Ittai ^a   Pnueli, Amir ^a,b   Zuck, Lenore D ^c  

^a NEW YORK UNIVERSITY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; BINARY TREES; COMPUTATION THEORY; TREES (MATHEMATICS);

SHAPE ANALYSIS; SINGLE PARENT HEAPS; TREE STRUCTURES;

MODEL CHECKING;

EID: 36348999658     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69738-1_7     Document Type: Conference Paper

References (21)

1. T. Arons, A. Pnueli, S. Ruah, J. Xu, and L. Zuck. Parameterized verification with automatically computed inductive assertions. In CAV'01, pages 221-234. LNCS 2102, 2001.
2. I. Balaban, A. Pnueli, and L. Zuck. Shape analysis of single-parent heaps. Research Report TR2006-885, Computer Science Department, New York University, Warren Weaver Hall, Room 405, 251 Mercer St., New York, NY 10012, November 2006.
3. I. Balaban, A. Pnueli, and L. D. Zuck. Shape analysis by predicate abstraction. In VMCAI'2005: Verification, Model Checking, and Abstraction Interpretation, pages 164-180, 2005.
4. I. Balaban, A. Pnueli, and L. D. Zuck. Modular ranking abstraction. To appear in International Journal of Foundations of Computer Science (IJFCS), 2007. See http://www.es.nyu.edu/acsys/pubs/permanent/ranking-companion-pre.pdf.
5. T. Ball and R. B. Jones, editors. Computer Aided Verification, 18th International Conference, CAV 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings, volume 4144 of Lecture Notes in Computer Science. Springer, 2006.
6. M. Benedikt, T. W. Reps, and S. Sagiv. A decidable logic for describing linked data structures. In S. D. Swierstra, editor, ESOP, volume 1576 of Lecture Notes in Computer Science, pages 2-19. Springer, 1999.
7. J. Berdine, B. Cook, D. Distefano, and P. W. O'Hearn. Automatic termination proofs for programs with shape-shifting heaps. In Ball and Jones [5], pages 386-400.
8. J. D. Bingham and Z. Rakamaric. A logic and decision procedure for predicate abstraction of heap-manipulating programs. In E. A. Emerson and K. S. Namjoshi, editors, VMCAI, volume 3855 of Lecture Notes in Computer Science, pages 207-221. Springer, 2006.
9. E. Borger, E. Grädei, and Y. Gurevich. The Classical Decision Problem. Perspectives of Mathematical Logic. Springer-Verlag, 1997. Second printing (Universitext) 2001.
10. A. Bouajjani, M. Bozga, P. Habermehl, R. Iosif, P. Moro, and T. Vojnar. Programs with lists are counter automata. In Ball and Jones [5], pages 517-531.
11. E. Grädei, M. Otto, and E. Rosen. Undecidability results on two-variable logics. In R. Reischuk and M. Morvan, editors, STACS, volume 1200 of Lecture Notes in Computer Science, pages 249-260. Springer, 1997.
12. N. Immerman, A. M. Rabinovich, T. W. Reps, S. Sagiv, and G. Yorsh. The boundary between decidability and undecidability for transitive-closure logics. In J. Marcinkowski and A. Tarlecki, editors, CSL, volume 3210 of Lecture Notes in Computer Science, pages 160-174. Springer, 2004.
13. N. Immerman, A. M. Rabinovich, T. W. Reps, S. Sagiv, and G. Yorsh. Verification via structure simulation. In Computer Aided Verification CAV, pages 281-294. Springer Verlag, 2004.
14. Y. Kesten and A. Pnueli. Verification by augmented finitary abstraction. Information and Computation, 163(1):203-243, 2000.
15. N. Klarlund and M. I. Schwartzbach. Graph types. In POPL '93: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 196-205, New York, NY, USA, 1993. ACM Press.
16. R. Manevich, E. Yahav, G. Ramalingam, and S. Sagiv. Predicate abstraction and canonical abstraction for singly-linked lists. In R. Cousot, editor, VMCAI, volume 3385 of Lecture Notes in Computer Science, pages 181-198. Springer, 2005.
17. A. Møller and M. I. Schwartzbach. The Pointer Assertion Logic Engine. In Programming Language Design and Implementation, 2001.
18. A. Pnueli and E. Shahar. A platform combining deductive with algorithmic verification. In Rajeev Alur and Thomas A. Henzinger, editors, Proceedings of the Eighth International Conference on Computer Aided Verification CAV, volume 1102, page 184, New Brunswick, NJ, USA, / 1996. Springer Verlag.
19. J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In LICS, pages 55-74. IEEE Computer Society, 2002.
20. T. Wies, V. Kuncak, P. Lam, A. Podelski, and M. Rinard. On field constraint analysis. In Verification, Model Checking, and Abstract Interpretation, 2006.
21. G. Yorsh, A. M. Rabinovich, M. Sagiv, A. Meyer, and A. Bouajjani. A logic of reachable patterns in linked data-structures. In L. Aceto and A. Ingólfsdóttir, editors, FoSSaCS, volume 3921 of Lecture Notes in Computer Science, pages 94-110. Springer, 2006.