Field constraint analysis

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

Volumn 3855 LNCS, Issue , 2006, Pages 157-173

  Wies, Thomas ^a   Kuncak, Viktor ^b   Lam, Patrick ^b   Podelski, Andreas ^a   Rinard, Martin ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA REDUCTION; DATA STRUCTURES; FORMAL LOGIC; INFORMATION TECHNOLOGY; INVARIANCE; SHAPE MEMORY EFFECT;

CONSTRAINTS ANALYSIS; CROSS CUTTING FIELDS; SHAPE ANALYSIS; STATIC DECLARATIONS;

CONSTRAINT THEORY;

EID: 33745654319     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (37)

1. R.-J. Back and J. von Wright. Refinement Calculus. Springer-Verlag, 1998.
2. I. Balaban, A. Pnueli, and L. Zuck. Shape analysis by predicate abstraction. In VMCAI'05, 2005.
3. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In POPL, pages 269-282, 1979.
4. D. Dams and K. S. Namjoshi. Shape analysis through predicate abstraction and model checking. In VMCAI'03, volume 2575 of LNCS, pages 310-323, 2003.
5. P. Fradet and D. L. Metayer. Shape types. In Proc. 24th ACM POPL, 1997.
6. R. Ghiya and L. Hendren. Is it a tree, a DAG, or a cyclic graph? In Proc. 23rd ACM POPL, 1996.
7. E. Grädel. Decidable fragments of first-order and fixed-point logic. From prefix-vocabulary classes to guarded logics. In Proceedings of Kalmar Workshop on Logic and Computer Science, Szeged, 2003.
8. . T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In POPL, 2002.
9. N. Immerman. Descriptive Complexity. Springer-Verlag, 1998.
10. N. Immerman, A. M. Rabinovich, T. W. Reps, S. Sagiv, and G. Yorsh. The boundary between decidability and undecidability for transitive-closure logics. In Computer Science Logic (CSL), pages 160-174, 2004.
11. N. Immerman, A. M. Rabinovich, T. W. Reps, S. Sagiv, and G. Yorsh. Verification via structure simulation. In CAV, pages 281-294, 2004.
12. J. L. Jensen, M. E. Jørgensen, N. Klarlund, and M. I. Schwartzbach. Automatic verification of pointer programs using monadic second order logic. In Proc. ACM PLDI, Las Vegas, NV, 1997.
13. N. Klarlund, A. Møller, and M. I. Schwartzbach. MONA implementation secrets. In Proc. 5th International Conference on Implementation and Application of Automata. LNCS, 2000.
14. N. Klarlund and M. I. Schwartzbach. Graph types. In Proc. 20th ACM POPL, Charleston, SC, 1993.
15. V. Kuncak, P. Lam, and M. Rinard. Role analysis. In Pmc. 29th POPL, 2002.
16. V. Kuncak, P. Lam, K. Zee, and M. Rinard. Implications of a data structure consistency checking system. In Int. conf. on Verified Software: Theories, Tools, Experiments (VSTTE, IFIP Working Group 2.3 Conference), Zürich, October 2005.
17. V. Kuncak and M. Rinard. Boolean algebra of shape analysis constraints. In Proc. 5th International Conference on Verification, Model Checking and Abstract Interpretation, 2004.
18. V. Kuncak and M. Rinard. Decision procedures for set-valued fields. In 1st International Workshop on Abstract Interpretation of Object-Oriented Languages (AIOOL 2005), 2005.
19. S. K. Lahiri and S. Qadeer. Verifying properties of well-founded linked lists. In POPL'06, 2006.
20. P. Lam, V. Kuncak, and M. Rinard. Generalized typestate checking for data structure consistency. In 6th International Conference on Verification, Model Checking and Abstract Interpretation, 2005.
21. P. Lam, V. Kuncak, and M. Rinard. Hob: A tool for verifying data structure consistency. In 14th International Conference on Compiler Construction (tool demo), April 2005.
22. O. Lee, H. Yang, and K. Yi. Automatic verification of pointer programs using grammar-based shape analysis. In ESOP, 2005.
23. T. Lev-Ami, N. Immerman, T. Reps, M. Sagiv, S. Srivastava, and G. Yorsh. Simulating reachability using first-order logic with applications to verification of linked data structures. In CADE-20, 2005.
24. T. Lev-Ami, T. Reps, M. Sagiv, and R. Wilhelm. Putting static analysis to work for verification: A case study. In International Symposium on Software Testing and Analysis, 2000.
25. S. McPeak and G. C. Necula. Data structure specifications via local equality axioms. In CAV, pages 476-490, 2005.
26. A. Møller and M. I. Schwartzbach. The Pointer Assertion Logic Engine. In Programming Language Design and Implementation, 2001.
27. S. S. Muchnick and N. D. Jones, editors. Program Flow Analysis: Theory and Applications. Prentice-Hall, Inc., 1981.
28. G. Nelson. Verifying reachability invariants of linked structures. In POPL, 1983.
29. A. Podelski and T. Wies. Boolean heaps. In SAS, 2005.
30. W. Pugh. Skip lists: A probabilistic alternative to balanced trees. In Communications of the ACM 33(6):668-676, 1990.
31. T. Reps, M. Sagiv, and A. Loginov. Finite differencing of logical formulas for static analysis. In Proc. 12th ESOP, 2003.
32. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM TOP/AS, 24(3):217-298, 2002.
33. T. Wies. Symbolic shape analysis. Master's thesis, Universität des Saarlandes, Saarbrücken, Germany, Sep 2004.
34. T. Wies, V. Kuncak, P. Lam, A. Podelski, and M. Rinard. On field constraint analysis. Technical Report MIT-CSAIL-TR-2005-072, MIT-LCS-TR-1010, MIT CSAIL, November 2005.
35. G. Yorsh, T. Reps, and M. Sagiv. Symbolically computing most-precise abstract operations for shape analysis. In 10th TACAS, 2004.
36. G. Yorsh, T. Reps, M. Sagiv, and R. Wilhelm. Logical characterizations of heap abstractions. TOCL, 2005. (to appear).
37. G. Yorsh, A. Skidanov, T. Reps, and M. Sagiv. Automatic assume/guarantee reasoning for heap-manupilating programs. In 1st AIOOL Workshop, 2005.