Dynamic Frames Based Verification Method for Concurrent Java Programs

Abstract

Abstract. In this paper we discuss a verification method for concurrent Java programs based on the concept of dynamic frames. We build on our earlier work that proposes a new, symbolic permission system for concurrent reasoning and we provide the following new contributions. First, we describe our approach for proving program specifications to be self-framed w.r.t. permissions, which is a necessary condition to maintain soundness in concurrent reasoning. Second, we show how we use predicates to provide modular and reusable specifications for program synchronisation points, like locks or forked threads. Our work primarily targets the KeY verification system with its specification language JML * and symbolic execution proving method. Hence, we also give the current status of the work on implementation and we discuss some examples that are verifiable with KeY.

Deductive Software Verification: From Pen-and-Paper Proofs to Industrial Tools

“…In addition to Java and C, the VerCors tool set also supports reasoning about OpenCL kernels, which is using a different concurrency paradigm [22]. Also the KeY verifier provides some support to reason interactively about data race freedom of concurrent applications [103]. This approach can be used in addition to VeriFast and VerCors, and is in particular suitable to trace the source of a failing verification.…”

Transactions on Modularity and Composition I

“…We have also applied model methods to support modular verification of concurrent Java programs specified with permission annotations [22,38]. In particular, we have used model methods to provide fully modular and reusable specifications for Java API synchronisation methods.…”