ISSE

Search

Interactive Verification of Concurrent Systems using Symbolic Execution

Simon Bäumler, Michael Balser, Wolfgang Reif, Gerhard Schellhorn

Interactive Verification of Concurrent Systems using Symbolic Execution

This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known and very intuitive strategy for the verification of sequential programs. We have carried over this approach to the interactive verification of arbitrary linear temporal logic properties of (infinite state) parallel programs. The resulting proof method is very intuitive to apply and can be automated to a large extent. It smoothly combines first order reasoning with reasoning in temporal logic. The proof method has been implemented in the interactive verification environment KIV and has been used in several case studies.
published 2008 LPAR 2008 Workshop: The 7th International Workshop on the Implementation of Logics

Publisher: CEUR Workshop Proceedings, Vol. 418


Downloads:

  • Paper  -  (Paper.pdf, 0 KB)