• There are IDEs for KeY, including an Eclipse extension, that make it easy to keep track of
proof obligations in larger projects [Hentschel et al., 2014c].• A stripped down version of …

We present Iris, a concurrent separation logic with a simple premise: monoids and invariants
are all you need. Partial commutative monoids enable us to express---and invariants enable …

VeriFast is a prototype verification tool for single-threaded and multithreaded C and Java
programs. In this paper, we first describe the basic symbolic execution approach in some …

Deductive software verification aims at formally verifying that all possible behaviors of a
given program satisfy formally defined, possibly complex properties, where the verification …

Concurrent separation logics (CSLs) have come of age, and with age they have
accumulated a great deal of complexity. Previous work on the Iris logic attempted to reduce …

We present impredicative concurrent abstract predicates–iCAP–a program logic for modular
reasoning about concurrent, higher-order, reentrant, imperative code. Building on earlier …

To avoid data races, concurrent operations should either be at distinct times or on distinct
data. Atomicity is the abstraction that an operation takes effect at a single, discrete instant in …

Grove is a concurrent separation logic library for verifying distributed systems. Grove is the
first to handle time-based leases, including their interaction with reconfiguration, crash …

Efficient concurrent programs and data structures rarely employ coarse-grained
synchronization mechanisms (ie, locks); instead, they implement custom synchronization …

Early in the development of Hoare logic, Owicki and Gries introduced auxiliary variables as
a way of encoding information about the history of a program's execution that is useful for …