A Dynamic Logic for Deductive Verification of Concurrent Java Programs With Condition Varia.pdfVIP

VAMP 2007 A Dynamic Logic for Deductive Verification of Concurrent Java Programs With Condition Variables Bernhard Beckert and Vladimir Klebanov 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 KeY system. In contrast to previous work, the version presented here includes the rules for handling condition variables. 1 Introduction 1.0.1 Motivation and Goals In this paper, we present a Dynamic Logic and a deductive verification calculus for a fragment of the JAVA language, which includes concurrency. Our aim has been to design a logic that (1) reflects the properties of Java concurrency in an intuitive manner (2) has a sound and (relatively) complete calculus (3) requires no intrinsic abstraction, no bounds on the state space or thread number (4) allows reasoning about properties of the scheduler within the logic, but does not require such reasoning for program verification. To achieve our goal, we currently have to make three important restrictions. First, we do not consider thread identities in programs. Second, we do not han- dle dynamic thread creation (but systems with an unbounded number of threads). Third, we require that all loops are executed atomically. These restrictions allow us to employ very efficient symmetry reductions and thus symbolically execute pro- grams in the presence of unbounded concurren