A Dynamic Logic for Deductive Verification of Concurrent Programs

Authors:
Bernhard Beckert;Vladimir Klebanov
Affiliations:
University of Koblenz-Landau;University of Koblenz-Landau
Venue:
SEFM '07 Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods
Year:
2007

Citing 0
Cited 2

A Verification System for Distributed Objects with Asynchronous Method Calls

ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
A system for compositional verification of asynchronous objects

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an approach aiming at full functional deductive verification of concurrent Java programs, based on symbolic execution. We define a Dynamic Logic and a deductive verification calculus for a restricted fragment of Java with native concurrency primitives. Even though we cannot yet deal with non-atomic loops, employing the technique of symmetry reduction allows us to verify unbounded systems. The calculus has been implemented within the KeYsystem, and we demonstrate it by verifying a central method of the StringBuffer class from the Java standard library.