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 …

Rust is a systems programming language that offers both low-level memory operations and
high-level safety guarantees, via a strong ownership type system that prohibits mutation of …

Linearisability is a key correctness criterion for concurrent data structures, ensuring that
each history of the concurrent object under consideration is consistent with respect to a …

Modular programming and modular verification go hand in hand, but most existing logics for
concurrency ignore two crucial forms of modularity:* higher-order functions*, which are …

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 …

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

Several functional correctness criteria have been proposed for relaxed-memory consistency
libraries, but most lack support for modular client reasoning. Mével and Jourdan recently …

We propose a practical verification framework for preemptive OS kernels. The framework
models the correctness of API implementations in OS kernels as contextual refinement of …

We present ReLoC: a logic for proving refinements of programs in a language with higher-
order state, fine-grained concurrency, polymorphism and recursive types. The core of our …

Transactional objects combine the performance of classical concurrent objects with the high-
level programmability of transactional memory. However, verifying the correctness of …