Shape analysis by predicate abstraction

Lecture Notes in Computer Science

Volumn 3385, Issue , 2005, Pages 164-180

  Balaban, Ittai ^a   Pnueli, Amir ^a   Zuck, Lenore D ^b  

^a NEW YORK UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACCIDENT PREVENTION; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; FINITE AUTOMATA; FUNCTIONS; MATHEMATICAL MODELS; THEOREM PROVING;

ABSTRACTION; FINITE STATE VERSION; HEAP NODES; LIVENESS; SHAPE ANALYSIS;

ABSTRACTING;

EID: 24144470812     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30579-8_12     Document Type: Conference Paper

References (16)

1. A. Pnueli and E. Shahar. A platform combining deductive with algorithmic verification. In Rajeev Alur and Thomas A. Henzinger, editors, Proceedings of the Eighth International Conference on Computer Aided Verification CAV, volume 1102, page 184, New Brunswick, NJ, USA, / 1996. Springer Verlag.
2. T. Arons, A. Pnueli, S. Ruah, J. Xu, and L. Zuck. Parameterized verification with automatically computed inductive assertions. In CAV'01, pages 221-234. LNCS 2102, 2001.
3. T. Ball, A. Podelski, and S. K. Rajamani. Relative completeness of abstraction refinement for software model checking. In Tools and Algorithms for Construction and Analysis of Systems, pages 158-172, 2002.
4. T. Ball and S. K. Rajamani. Automatically validating temporal safety properties of interfaces. Lecture Notes in Computer Science, 2057: 103+, 2001.
5. M. Benedikt, T. W. Reps, and S. Sagiv. A decidable logic for describing linked data structures. In European Symposium on Programming, pages 2-19, 1999.
6. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In Computer Aided Verification, pages 154-169, 2000.
7. D. Dams and K. S. Namjoshi. Shape analysis through predicate abstraction and model checking. In Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation, pages 310-324. Springer-Verlag, 2003.
8. S. Das and D. L. Dill. Successive approximation of abstract transition relations. In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, page 51. IEEE Computer Society, 2001.
9. S. Das, D. L. Dill, and S. Park. Experience with predicate abstraction. In Proceedings of the 11th International Conference on Computer Aided Verification, pages 160-171. Springer-Verlag, 1999.
10. C. Flanagan and S. Qadeer. Predicate abstraction for software verification. In Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 191-202. ACM Press, 2002.
11. N. Jones and S. Muchnick. Flow analysis and optimization of Lisp-like structures. In S. Muchnick and N. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 4, pages 102-131. Prentice-Hall, Englewood Cliffs, NJ, 1981.
12. Y. Kesten and A. Pnueli. Verification by augmented finitary abstraction. Information and Computation, 163(l):203-243, 2000.
13. G. Nelson. Verifying Reachability Invariants of Linked Structures. In Proc. 10th ACM Symp. Princ. of Prog. Long., pages 38-47, 1983.
14. A. Pnueli, S. Ruah, and L. Zuck. Automatic deductive verification with invisible invariants. In TACAS'01, pages 82-97. LNCS 2031,2001.
15. S. Graf and H. Saidi. Construction of abstract state graphs with PVS. In O. Grumberg, editor, Proc. 9th INternational Conference on Computer Aided Verification (CAV'97), volume 1254, pages 72-83. Springer Verlag, 1997.
16. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM Trans. Program. Lang. Syst., 24(3):217-298, 2002.