Boolean algebra of shape analysis constraints

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

Volumn 2937, Issue , 2004, Pages 59-72

  Kuncak, Viktor ^a   Rinard, Martin ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Abstract interpretation; Boolean algebra; First order logic; Model checking; Program verification; Shape analysis

Indexed keywords

ABSTRACTING; COMPUTER CIRCUITS; DATA FLOW ANALYSIS; EQUIVALENCE CLASSES; MODEL CHECKING; SYNTACTICS;

ABSTRACT INTERPRETATIONS; BOOLEAN OPERATIONS; EQUIVALENCE PROBLEM; FIRST ORDER LOGIC; PARAMETRIC SHAPE ANALYSIS; PROGRAM VERIFICATION; SATISFIABILITY PROBLEMS; SHAPE ANALYSIS;

BOOLEAN ALGEBRA;

EID: 84944225627     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24622-0_7     Document Type: Conference Paper

References (50)

1. Ralph-Johan Back and Joakim von Wright. Refinement Calculus. Springer-Verlag, 1998.
2. Thomas Ball, Rupak Majumdar, Todd Millstein, and Sriram K. Rajamani. Automatic predicate abstraction of C programs. In Proc. ACM PLDI, 2001.
3. Thomas Ball, Andreas Podelski, and Sriram K. Rajamani. Relative completeness of abstraction refinement for software model checking. In TACAS’02, volume 2280 of LNCS, page 158, 2002.
4. Michael Benedikt, Thomas Reps, and Mooly Sagiv. A decidable logic for linked data structures. In Proc. 8th ESOP, 1999.
5. Marc Berndl, Ondrej Lhoták, Feng Qian, Laurie Hendren, and Navindra Umanee. Points-to analysis using BDDs. In PLDI 2003, 2003.
6. Bruno Blanchet, Patrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne, Antoine Miné, David Monniaux, and Xavier Rival. A Static Analyzer for Large Safety-Critical Software. In ACM PLDI, San Diego, California, June 2003. ACM.
7. Marius Bozga, Radu Iosif, and Yassine Laknech. Storeless semantics and alias logic. In ACM PEPM’03, pages 55–65. ACM Press, 2003.
8. William R. Bush, Jonathan D. Pincus, and David J. Sielaff. A static analyzer for finding dynamic programming errors. Software—Practice & Experience, 30(7):775–802, 2000.
9. David R. Chase, Mark Wegman, and F. Kenneth Zadeck. Analysis of pointers and structures. In Proc. ACM PLDI, 1990.
10. Lori Clarke and Debra Richardson. Symbolic evaluation methods for program analysis. In Program Flow Analysis: Theory and Applications, chapter 9. Prentice- Hall, Inc., 1981.
11. Dennis Dams and Kedar S. Namjoshi. Shape analysis through predicate abstraction and model checking. In VMCAI 2003, volume 2575 of LNCS, pages 310–323, 2003.
12. Alain Deutsch. Interprocedural may-alias analysis for pointers: Beyond k-limiting. In Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, pages 230–241. ACM Press, 1994.
13. Dawson Engler, Benjamin Chelf, Andy Chou, and Seth Hallem. Checking system rules using system-specific, programmer-written compiler extensions. In Proc. 4th USENIX OSDI, 2000.
14. 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.
15. Pascal Fradet and Daniel Le Métayer. 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. Susanne Graf and Hassen Saidi. Construction of abstract state graphs with pvs. In Proc. 9th CAV, pages 72–83, 1997.
18. C. A. R. Hoare and He Jifeng. A trace model for pointers and objects. In Proc. 13th ECOOP, volume 1628 of LNCS, 1999.
19. Gerard J. Holzmann. Static source code checking for user-defined properties. In Proc. IDPT 2002, Pasadena, CA, June 2002.
20. Joseph Hummel, Laurie J. Hendren, and Alexandru Nicolau. A general data dependence test for dynamic, pointer-based data structures. In Proc. ACM PLDI, 1994.
21. Samin Ishtiaq and Peter W. O’Hearn. BI as an assertion language for mutable data structures. In Proc. 28th ACM POPL, 2001.
22. N. D. Jones and S. S. Muchnick. Flexible approach to interprocedural data flow analysis and programs with recursive data structures. In Proc. 9th ACM POPL, 1982.
23. Nils Klarlund, Anders Møller, and Michael I. Schwartzbach. MONA implementation secrets. In Proc. 5th International Conference on Implementation and Application of Automata. LNCS, 2000.
24. Stephen Cole Kleene. Introduction to Metamathematics. D. Van Nostrand Company, Inc., Princeton, New Jersey, 1952. fifth reprint, 1967.
25. Viktor Kuncak, Patrick Lam, and Martin Rinard. A language for role specifications. In Proceedings of the 14th Workshop on Languages and Compilers for Parallel Computing, volume 2624 of Lecture Notes in Computer Science, Springer, 2001.
26. Viktor Kuncak, Patrick Lam, and Martin Rinard. Roles are really great! Technical Report 822, Laboratory for Computer Science, Massachusetts Institute of Technology, 2001.
27. Viktor Kuncak, Patrick Lam, and Martin Rinard. Role analysis. In Proc. 29th POPL, 2002.
28. Viktor Kuncak and Martin Rinard. Typestate checking and regular graph constraints. Technical Report 863, MIT Laboratory for Computer Science, 2002.
29. Viktor Kuncak and Martin Rinard. Existential heap abstraction entailment is undecidable. In 10th Annual International Static Analysis Symposium (SAS 2003), San Diego, California, June 11–13 2003.
30. Viktor Kuncak and Martin Rinard. On role logic. Technical Report 925, MIT CSAIL, 2003.
31. Viktor Kuncak and Martin Rinard. On the boolean algebra of shape analysis constraints. Technical report, MIT CSAIL, August 2003.
32. James R. Larus and Paul N. Hilfinger. Detecting conflicts between structure accesses. In Proc. ACM PLDI, Atlanta, GA, June 1988.
33. Tal Lev-Ami. TVLA: A framework for kleene based logic static analyses. Master’s thesis, Tel-Aviv University, Israel, 2000.
34. Tal Lev-Ami, Thomas Reps, Mooly Sagiv, and Reinhard Wilhelm. Putting static analysis to work for verification: A case study. In International Symposium on Software Testing and Analysis, 2000.
35. Francesco Logozzo. Class-level modular analysis for object oriented languages. In Static Analysis, 10th International Symposium, SAS 2003, San Diego, CA, USA, June 11–13, 2003, Proceedings, volume 2694 of Lecture Notes in Computer Science. Springer, 2003.
36. Roman Manevich, G. Ramalingam, John Field, Deepak Goyal, and Mooly Sagiv. Compactly representing first-order structures for static analysis. In Proc. 9th International Static Analysis Symposium, pages 196–212, 2002.
37. Anders Møller and Michael I. Schwartzbach. The Pointer Assertion Logic Engine. In Proc. ACM PLDI, 2001.
38. Flemming Nielson, Hanne Riis Nielson, and Mooly Sagiv. Kleene’s logic with equality. Information Processing Letters, 80(3):131–137, 2001.
39. Thomas Reps, Mooly Sagiv, and Alexey Loginov. Finite differencing of logical formulas for static analysis. In Proc. 12th ESOP, 2003.
40. Thomas Reps, Mooly Sagiv, and Greta Yorsh. Symbolic implementation of the best transformer. Technical Report TR-1468, University of Wisconsin, January 2003.
41. Thomas Reps, Mooly Sagiv, and Greta Yorsh. Symbolic implementation of the best transformer. In VMCAI’04, 2004.
42. Noam Rinetzky. Interprocedural shape analysis. Master’s thesis, Technion - Israel Institute of Technology, 2000.
43. Noam Rinetzky and Mooly Sagiv. Interprocedual shape analysis for recursive programs. In Proc. 10th International Conference on Compiler Construction, 2001.
44. Mooly Sagiv, Thomas Reps, and Reinhard Wilhelm. Solving shape-analysis problems in languages with destructive updating. ACM TOPLAS, 20(1):1–50, 1998.
45. Mooly Sagiv, Thomas Reps, and Reinhard Wilhelm. Parametric shape analysis via 3-valued logic. In Proc. 26th ACM POPL, 1999.
46. Mooly Sagiv, Thomas Reps, and Reinhard Wilhelm. Parametric shape analysis via 3-valued logic. ACM TOPLAS, 24(3):217–298, 2002.
47. Frederick Smith, David Walker, and Greg Morrisett. Alias types. In Proc. 9th ESOP, Berlin, Germany, March 2000.
48. Greta Yorsh. Logical characterizations of heap abstractions. Master’s thesis, Tel- Aviv University, March 2003.
49. Greta Yorsh, Thomas Reps, and Mooly Sagiv. Symbolically computing mostprecise abstract operations for shape analysis. Technical report, Tel-Aviv University, September 2003. Forthcoming.
50. Greta Yorsh, Thomas Reps, Mooly Sagiv, and Reinhard Wilhelm. Logical characterizations of heap abstractions. Technical report, University of Wisconsin, Madison, January 2003.