Interactive verification of concurrent systems using symbolic execution

Authors:
Simon Bäumler;Michael Balser;Florian Nafz;Wolfgang Reif;Gerhard Schellhorn
Affiliations:
Corespd. E-mail: baeumler@informatik.uni-augsburg.de;-;-;-;Lehrstuhl für Softwaretechnik und Programmiersprachen, Universität Augsburg, D-86135 Augsburg, Germany. E-mails: {baeumler, balser, nafz, reif, schellhorn}@informatik.uni-augsburg.de
Venue:
AI Communications - Practical Aspects of Automated Reasoning
Year:
2010

Citing 22
Cited 4

Concurrent dynamic logic

Journal of the ACM (JACM)
Proofs and types

Proofs and types
Tentative steps toward a development method for interfering programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Verification of sequential and concurrent programs

Verification of sequential and concurrent programs
The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
The temporal logic of actions

ACM Transactions on Programming Languages and Systems (TOPLAS)
Conjoining specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Temporal verification of reactive systems: safety

Temporal verification of reactive systems: safety
Parallel composition of assumption-commitment specifications

Acta Informatica
Verifying Temporal Properties of Reactive Systems: A STeP Tutorial

Formal Methods in System Design
Concurrency verification: introduction to compositional and noncompositional methods

Concurrency verification: introduction to compositional and noncompositional methods
Introduction to VLSI Systems

Introduction to VLSI Systems
Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers

Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers
Is the interesting part of process logic uninteresting?: a translation from PL to PDL

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Formulation of TLA in Isabelle

Proceedings of the 8th International Workshop on Higher Order Logic Theorem Proving and Its Applications
A Dynamic Logic for Program Verification

Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at Botik '89
Proofs of Networks of Processes

IEEE Transactions on Software Engineering
A Temporal Logic for Multilevel Reasoning about Hardware

Computer
The rely-guarantee method in Isabelle/HOL

ESOP'03 Proceedings of the 12th European conference on Programming
Formal safety analysis of a radio-based railroad crossing using deductive cause-consequence analysis (DCCA)

EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Interactive verification of medical guidelines

FM'06 Proceedings of the 14th international conference on Formal Methods
Verification of medical guidelines by model checking – a case study

SPIN'06 Proceedings of the 13th international conference on Model Checking Software

Temporal logic verification of lock-freedom

MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
A formal framework for compositional verification of organic computing systems

ATC'10 Proceedings of the 7th international conference on Autonomic and trusted computing
Formal verification of a lock-free stack with hazard pointers

ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
State of the art: Dynamic symbolic execution for automated test generation

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.