Data structure specifications via local equality axioms

Lecture Notes in Computer Science

Volumn 3576, Issue , 2005, Pages 476-490

  McPeak, Scott ^a   Necula, George C ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CELL CULTURE; DECISION MAKING; HEURISTIC METHODS;

DATA STRUCTURE SPECIFICATIONS; LOCAL EQUALITY AXIOMS; MEMORY CELLS; POINTER EQUALITIES;

DATA STRUCTURES;

EID: 26444435643     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11513988_47     Document Type: Conference Paper

References (19)

1. D. Cantone and C. G. Zarba. A new fast decision procedure for an unquantified fragment of set theory. In First-Order Theorem Proving, pages 97-105, 1998.
2. D. Detlefs, G. Nelson, and J. B. Saxe. Simplify: A theorem prover for program checking. Technical Report HPL-2003-148, HP Labs, July 2003.
3. D. L. Detlefs, K. R. M. Leino, G. Nelson, and J. B. Saxe. Extended static checking. Technical Report SRC-159, COMPAQ SRC, Palo Alto, USA, Dec. 1998.
4. P. Fradet and D. L. Métayer. Shape types. In POPL, pages 27-39, 1997.
5. B. Hackett and R. Rugina. Region-based shape analysis with tracked locations. In POPL, pages 310-323, 2005.
6. N. Immerman, A. Rabinovich, T. Reps, M. Sagiv, and G. Yorsh. The boundary between decidability and undecidability for transitive-closure logics. In CSL, 2004.
7. N. Klarlund and M. Schwartzbach. Graph types. In POPL, pages 196-205, 1993.
8. D. E. Knuth and P. B. Bendix. Simple word problems in universal algebra. In J. Leech, editor, Computational Problems in Abstract Algebras, pages 263-297. Pergamon Press, 1970.
9. V. Kuncak, P. Lam, and M. Rinard. Role analysis. In POPL, pages 17-32, 2002.
10. V. Kuncak and M. Rinard. Existential heap abstraction entailment is undecidable. In SAS, pages 418-438, 2003.
11. K. R. M. Leino and P. Müller. Object invariants in dynamic contexts. In European Conference on Object-Oriented Programming (ECOOP), 2004.
12. T. Lev-Ami and S. Sagiv. TVLA: A system for implementing static analyses. In Static Analysis Symposium, pages 280-301, 2000.
13. A. Möller and M. Schwartzbach. The pointer assertion logic engine. In PLDI, pages 221-231, 2001.
14. G. Nelson. Techniques for program verification. Technical Report CSL-81-10, Xerox Palo Alto Research Center, 1981.
15. G. Nelson. Verifying reachability invariants of linked structures. In POPL, pages 38-47, 1983.
16. G. Nelson and D. C. Oppen. Fast decision procedures based on congruence closure. JACM, 27(2):356-364, Apr. 1980.
17. D. C. Oppen. Reasoning about recursively denned data structures. JACM, 27(3):403-411, July 1980.
18. J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In Logic in Computer Science, pages 55-74, 2002.
19. S. Sagiv, T. W. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. TOPLAS, 24(3):217-298, 2002.