The C/C++ 11 memory model defines the semantics of concurrent memory accesses in
C/C++, and in particular supports racy" atomic" accesses at a range of different consistency …

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

We present a stateless model checking algorithm for verifying concurrent programs running
under RC11, a repaired version of the C/C++ 11 memory model without dependency cycles …

Large-scale distributed systems often rely on replicated databases that allow a programmer
to request different data consistency guarantees for different operations, and thereby control …

The field of concurrent separation logics (CSLs) has recently undergone two exciting
developments:(1) the Iris framework for encoding and unifying advanced higher-order CSLs …

The Rust programming language supports safe systems programming by means of a strong
ownership-tracking type system. In their prior work on RustBelt, Jung et al. began the task of …

We present GenMC, a model checking algorithm for concurrent programs that is parametric
in the choice of memory model and can be used for verifying clients of concurrent libraries …

We show that the weak memory model introduced by the 2011 C and C++ standards does
not permit many common source-to-source program transformations (such as expression …

Fine-grained concurrent programs are difficult to get right, yet play an important role in
modern-day computers. We want to prove strong specifications of such programs, with …

Weak memory models formalize the inconsistent behaviors that one can expect to observe
in multithreaded programs running on modern hardware. In so doing, however, they …