Verifying temporal heap properties specified via evolution logic

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

Volumn 2618, Issue , 2003, Pages 204-222

  Yahav, Eran ^a   Reps, Thomas ^b   Sagiv, Mooly ^a   Wilhelm, Reinhard ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b University of Wisconsin Madison   (United States)

^c SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; JAVA PROGRAMMING LANGUAGE; TEMPORAL LOGIC;

ABSTRACT INTERPRETATIONS; CLASSICAL MODEL; DE-ALLOCATION; FIRST-ORDER TEMPORAL LOGIC; JAVA-LIKE PROGRAMS; LIVENESS PROPERTIES; TEMPORAL PROPERTY;

MODEL CHECKING;

EID: 35248859723     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36575-3_15     Document Type: Article

References (20)

1. E.M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
2. J. C. Corbett, M. B. Dwyer, J. Hatcliff, and Robby. A language framework for expressing checkable properties of dynamic software. In SPIN, 2000.
3. B. Courcelle. On the expression of graph properties in some fragments of monadic second-order logic. In N. Immerman and P.G. Kolaitis, editors. Descriptive Complexity and Finite Models: Proceedings of a DIAMCS Workshop, chapter 2, pages 33-57. American Mathematical Society, 1996.
4. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points. In POPL, 1977.
5. P. Cousot and R. Cousot. Temporal abstract interpretation. In Proc. of 27th POPL, pages 12-25, January 2000.
6. N. Dor, M. Rodeh, and M. Sagiv. Checking cleanness in linked lists. In SAS. Springer, 2000.
7. M. B. Dwyer, G. S. Avrunin, and J. C. Corbett. Patterns in property specifications for finite-state verification. In Proc. of Int. Conf. on Software Engineering, pages 411-421, May 1999.
8. M. Fitting and R.L. Mendelsohn. First-Order Modal Logic, volume 277 of Synthese Library. Kluwer Academic Publishers, Dordrecht, 1998.
9. G.E. Hughes and M.J. Creswel. An Introduction to Modal Logic. Methuen, London, 1982.
10. Y. Kesten, A. Pnueli, and M. Vardi. Verification by augmented abstraction: The automatatheoretic view. JCSS: J. of Camp. Sys. Sci., 62, 2001.
11. T. Lev-Ami and M. Sagiv. TVLA: A framework for Kleene based static analysis. In Static Analysis Symposium. Springer, 2000.
12. D. Lewis. Counterpart theory and quantified modal logic. Journal of Philosophy, LXV(5):113-126, 1968.
13. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer, 1995.
14. A. Pnueli, J. Xu, and L. Zuck. Liveness with(0,1,infinity)-counter abstraction. CAV 2002.
15. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems, 24(3):217.
16. M.Y. Vardi and Pierre Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, 15 November 1994.
17. E. Yahav. http://www.cs.tau.ac.il/~yahave.
18. E. Yahav. Verifying safety properties of concurrent Java programs using 3-valued logic. In Proc. of 27th POPL, pages 27-40, March 2001.
19. E. Yahav, T. Reps, and M. Sagiv. LTL model checking for systems with unbounded number of dynamically created threads and objects. Technical Report TR-1424, CS Dept., Univ. of Wisconsin, Madison, WI, March 2001.
20. E. Yahav, T. Reps, M. Sagiv, and R. Wilhelm. Automatic verification of temporal properties of concurrent heap-manipulating programs using evolution logic. Technical Report 338/02, School of CS, Tel Aviv University, Israel, July 2002.