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 …

A central task in high-level synthesis is scheduling: the allocation of operations to clock
cycles. The classic approach to scheduling is static, in which each operation is mapped to a …

We present IronSync, an automated verification framework for concurrent code with shared
memory. IronSync scales to complex systems by splitting system-wide proofs into isolated …

Concurrent data structures and synchronization mechanisms implemented by expert
developers are indispensable for modular software development. In this paper, we address …

We use Iris, an implementation of concurrent separation logic in the Coq proof assistant, to
verify two queue data structures used for inter-process communication in an operating …

Weak persistent memory (aka non-volatile memory) is an emerging technology that offers
fast byte-addressable durable main memory. A wealth of algorithms and libraries has been …

We develop an account of dependent session protocols in concurrent separation logic for a
functional language with message-passing. Inspired by minimalistic session calculi, we …

We present the first formal specification and verification of the fine-grained concurrent multi-
producer-multi-consumer queue algorithm from Meta's C++ library Folly of core infrastructure …

Clients reason about the behavior of concurrent data structure libraries such as sets,
queues, or stacks using specifications that capture well-understood correctness conditions …

We present a stepwise refinement approach to develop verified parallel algorithms, down to
efficient LLVM code. The resulting algorithms' performance is competitive with their …