Skip Navigation


Logic Journal of IGPL Advance Access originally published online on September 30, 2006
Logic Journal of IGPL 2006 14(5):755-783; doi:10.1093/jigpal/jzl009
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
14/5/755    most recent
jzl009v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Yahav, E.
Right arrow Articles by Wilhelm, R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2006. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Verifying Temporal Heap Properties Specified via Evolution Logic

E. Yahav

School of Computer Science, Tel Aviv University, Tel Aviv, 69978, Israel. E-mail: yahave{at}post.tau.ac.il

T. Reps

Computer Sciences Department, University of Wisconsin, Madison, WI 53706, USA. E-mail: reps{at}cs.wisc.edu

M. Sagiv

School of Computer Science, Tel Aviv University, Tel Aviv, 69978, Israel. E-mail: msagiv{at}post.tau.ac.il

R. Wilhelm

Informatik, Universität des Saarlandes, Saarbrücken, Germany. E-mail: wilhelm{at}cs.uni-sb.de


  Abstract

This paper addresses the problem of establishing temporal properties of programs written in languages, such as Java, that make extensive use of the heap to allocate—and deallocate—new objects and threads. Establishing liveness properties is a particularly hard challenge. One of the crucial obstacles is that heap locations have no static names and the number of heap locations is unbounded. The paper presents a framework for the verification of Java-like programs. Unlike classical model checking, which uses propositional temporal logic, we use first-order temporal logic to specify temporal properties of heap evolutions; this logic allows domain changes to be expressed, which permits allocation and deallocation to be modelled naturally. The paper also presents an abstract-interpretation algorithm that automatically verifies temporal properties expressed using the logic.

Key Words: Verification • first-order logic • temporal logic • abstract interpretation


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.