Skip Navigation

Journal of Logic and Computation 2002 12(4):549-560; doi:10.1093/logcom/12.4.549
© 2002 by Oxford University Press
This Article
Right arrow Full Text (PDF)
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 Balser, M.
Right arrow Articles by Schellhorn, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Article

Verifying Concurrent Systems with Symbolic Execution

Michael Balser1, Christoph Duelli1, Wolfgang Reif1 and Gerhard Schellhorn1

1 Lehrstuhl Softwaretechnik und Programmiersprachen, Universität Augsburg, D-86135 Augsburg, Germany. E-mail: balser{at}informatik.uni-augsburg.deduelli{at}informatik.uni-augsburg.dereif{at}informatik.uni-augsburg.deschellhorn{at}informatik.uni-augsburg.de

Current techniques for interactively proving temporal properties of concurrent systems translate transition systems into temporal formulas by introducing program counter variables. Proofs are not intuitive, because control flow is not explicitly considered. For sequential programs symbolic execution is a very intuitive, interactive proof strategy. In this paper we will adopt this technique for parallel programs. Properties are formulated in interval temporal logic. An inplementation in the interactive theorem prover KIV has shown that this technique offers a high degree of automation and allows simple, local invariants.

Keywords: Symbolic execution; induction; temporal logic; parallel program; concurrent system; program verification

Received January 2001.


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.