Existential heap abstraction entailment is undecidable

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

Volumn 2694, Issue , 2003, Pages 418-438

  Kuncak, Viktor ^a   Rinard, Martin ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Graph Homomorphism; Monadic Second Order Logic; Post Correspondence Problem; Program Verification; Shape Analysis; Type Checking; Typestate

Indexed keywords

FORMAL LOGIC; SPECIFICATION LANGUAGES; STATIC ANALYSIS;

GRAPH HOMOMORPHISMS; MONADIC SECOND-ORDER LOGIC; POST CORRESPONDENCE PROBLEMS; PROGRAM VERIFICATION; SHAPE ANALYSIS; TYPECHECKING; TYPESTATE;

GRAPH THEORY;

EID: 26444605990     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44898-5_24     Document Type: Article

References (36)

1. Michael Benedikt, Thomas Reps, and Mooly Sagiv. A decidable logic for linked data structures. In Proc. 8th European Symposium on Programming, 1999.
2. Egon Börger, Erich Gräedel, and Yuri Gurevich. The Classical Decision Problem. Springer-Verlag, 1997.
3. Cristiano Calcagno, Luca Cardelli, and Andrew D. Gordon. Deciding validity in a spatial logic for trees. Submitted, September 2002.
4. Venkatesan T. Chakaravarthy and Susan B. Horwitz. On the non-approximability of points-to analysis. Acta Informatica, 38(8):587-598, June 2002.
5. David R. Chase, Mark Wegman, and F. Kenneth Zadeck. Analysis of pointers and structures. In Proc. ACM PLDI, 1990.
6. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997. release 1 October 2002.
7. Bruno Courcelle. The expression of graph properties and graph transformations in monadic second-order logic. In Handbook of graph grammars and computing by graph transformations, Vol. 1 : Foundations, chapter 5. World Scientific, 1997.
8. Manuvir Das, Sorin Lerner, and Mark Seigle. ESP: Path-sensitive program verification in polynomial time. In Proc. ACM PLDI, 2002.
9. Robert DeLine and Manuel Fähndrich. Enforcing high-level protocols in low-level software. In Proc. ACM PLDI, 2001.
10. S. Drossopoulou, F. Damiani, M. Dezani-Ciancaglini, and P. Giannini. Fickle: Dynamic object re-classification. In Proc. 15th European Conference on Object-Oriented Programming, LNCS 2072, pages 130-149. Springer, 2001.
11. Dawson Engler, Benjamin Chelf, Andy Chou, and Seth Hallem. Checking system rules using systemspecific, programmer-written compiler extensions. In Proc. 4th USENIX Symposium on Operating Systems Design and Implementation, 2000.
12. Ronald Fagin, Larry J. Stockmeyer, and Moshe Y. Vardi. On monadic NP vs monadic co-NP. Information and Computation, 120(1), 1995.
13. Cormac Flanagan, K. Rustan M. Leino, Mark Lilibridge, Greg Nelson, James B. Saxe, and Raymie Stata. Extended Static Checking for Java. In Proc. ACM PLDI, 2002.
14. Jeffrey S. Foster, Tachio Terauchi, and Alex Aiken. Flow-sensitive type qualifiers. In Proc. ACM PLDI, 2002.
15. Pascal Fradet and Daniel Le Metayer. Shape types. In Proc. 24th ACM POPL, 1997.
16. Rakesh Ghiya and Laurie Hendren. Is it a tree, a DAG, or a cyclic graph? In Proc. 23rd ACM POPL, 1996.
17. Dora Giammarresi and Antonio Restivo. Two-dimensional languages. In Grzegorz Rozenberg and Arto Salomaa, editors, Handbook of Formal Languages Vol.3: Beyond Words. Springer-Verlag, 1997.
18. Wilfrid Hodges. Model Theory, volume 42 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, 1993.
19. Neil Immerman. Descriptive Complexity. Springer-Verlag, 1998.
20. Daniel Jackson. Alloy: A lightweight object modelling notation. Technical Report 797, MIT Laboratory for Computer Science, 2000.
21. Viktor Kuncak, Patrick Lam, and Martin Rinard. Role analysis. In Proc. 29th A CM POPL, 2002.
22. Viktor Kuncak and Martin Rinard. Typestatc checking and regular graph constraints. Technical Report 863, MIT Laboratory for Computer Science, 2002. http://www.mit.edu/~vkuncak/papers/index.html.
23. James R. Larus and Paul N. Hilfinger. Detecting conflicts between structure accesses. In Proc. ACM PLDI, Atlanta, GA, June 1988.
24. Anders Møller and Michael I. Schwartzbach. The Pointer Assertion Logic Engine. In Proc. ACM PLDI, 2001.
25. Greg Nelson. Techniques for program verification. Technical report, XEROX Palo Alto Research Center, 1981.
26. Flemming Nielson, Hanne Riis Nielson, and Chris Hankin. Principles of Program Analysis. Springer-Verlag, 1999.
27. Ganesan Ramalingam. The undecidability of aliasing. ACM Transactions on Programming Languages and Systems (TOPLAS), 16(5):1467-1471, 1994.
28. H. G. Rice. Classes of recursively enumerable sets and their decision problems. Transactions of the American Mathematical Society, 89:25-29, 1953.
29. Neil Robertson and Paul D. Seymour. Graph minors: A survey. In Ian Anderson, editor, Surveys in Combinatorics Papers for the London Math. Soc. Lecture Note Series, 1985.
30. Mooly Sagiv, Thomas Reps, and Reinhard Wilhelm. Solving shape-analysis problems in languages with destructive updating. ACM TOPLAS, 20(1):1-50, 1998.
31. Mooly Sagiv, Thomas Reps, and Reinhard Wilhelm. Parametric shape analysis via 3-valued logic. ACM TOPLAS, 24(3):217-298, 2002.
32. Michael Sipser. Introduction to the Theory of Computation. PWS Publishing Company, 1997.
33. F. Smith, D. Walker, and G. Morrisett. Alias types. In Proc. 9th European Symposium on Programming, Berlin, Germany, March 2000.
34. Robert E. Strom and Shaula Yemini. Typestate: A programming language concept for enhancing software reliability. IEEE Transactions on Software Engineering, January 1986.
35. Wolfgang Thomas. Languages, automata, and logic. In Handbook of Formal Languages Vol.3: Beyond Words. Springer-Verlag, 1997.
36. David Walker and Greg Morrisett. Alias types for recursive data structures. In Workshop on Types in Compilation, 2000.