Automatic verification of pointer programs using grammar-based shape analysis

Lecture Notes in Computer Science

Volumn 3444, Issue , 2005, Pages 124-140

  Lee, Oukseh ^a   Yang, Hongseok ^b   Yi, Kwangkeun ^b  

^a Hanyang University   (South Korea)

^b Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ACCIDENT PREVENTION; ALGORITHMS; DATA STORAGE EQUIPMENT; DATA STRUCTURES; TREES (MATHEMATICS);

AUTOMATIC VERIFICATION; GRAMMAR-BASED SHAPE ANALYSIS; POINTER PROGRAMS; SAFETY ERRORS;

COMPUTER SOFTWARE;

EID: 24644443912     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31987-0_10     Document Type: Conference Paper

References (15)

1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. MIT Press and McGraw-Hill Book Company, 2001.
2. Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the ACM Symposium on Principles of Programming Languages, pages 238-252, January 1977.
3. Patrick Cousot and Radhia Cousot. Abstract interpretation frameworks. J. Logic and Comput., 2(4):511-547, 1992.
4. Patrick Cousot and Radhia Cousot. Formal language, grammar and set-constraint-based program analysis by abstract interpretation. In Proceedings of the ACM Conference on Functional Programming Languages and Computer Architecture, pages 170-181, La Jolla, California, June 1995. ACM Press, New York, NY.
5. A. Deutsch. Interprocedural may-alias analysis for pointers: Beyond k-limiting. In Proceedings of the ACM Conference on Programming Language Design and Implementation, pages 230-241. ACM Press, 1994.
6. Pascal Pradet and Daniel Le Métayer. Shape types. In Proceedings of the ACM Symposium on Principles of Programming Languages, pages 27-39. ACM Press, January 1997.
7. Nils Klarlund and Michael I. Schwartzbach. Graph types. In Proceedings of the ACM Symposium on Principles of Programming Languages, January 1993.
8. Oukseh Lee, Hongseok Yang, and Kwangkeun Yi. Automatic verification of pointer programs using grammar-based shape analysis. Tech. Memo. ROPAS-2005-23, Programming Research Laboratory, School of Computer Science & Engineering, Seoul National University, March 2005.
9. R. Manevich, M. Sagiv, G. Ramalingam, and J. Field. Partially disjunctive heap abstraction. In Proceedings of the International Symposium on Static Analysis, volume 3148 of Lecture Notes in Computer Science, pages 265-279, August 2004.
10. A. Møller and M. I. Schwartzbach. The pointer assertion logic engine. In Proceedings of the ACM Conference on Programming Language Design and Implementation. ACM, June 2001.
11. Peter W. O'Hearn, Hongseok Yang, and John C. Reynolds. Separation and information hiding. In Proceedings of the ACM Symposium on Principles of Programming Languages, pages 268-280. ACM Press, January 2004.
12. John C. Reynolds. Separation logic: A logic for shared mutable data structures. In Proceedings of the 17th IEEE Symposium on Logic in Computer Science, pages 55-74. IEEE, July 2002.
13. M. Sagiv, T. Reps, and R. Wilhelm. Solving shape-analysis problems in languages with destructive updating. ACM Trans. Program. Lang. Syst., 20(1):1-50, January 1998.
14. Mooly Sagiv, Thomas Reps, and Reinhard Wilhelm. Parametric shape analysis via 3-valued logic. ACM Trans. Program. Lang. Syst., 24(3):217-298, 2002.
15. Élodie-Jane Sims. Extending separation logic with fixpoints and postponed substitution. In Proceedings of the International Conference on Algebraic Methodology and Software Technology, volume 3116 of Lecture Notes in Computer Science, pages 475-490, 2004.