We propose an axiomatic generic framework for modelling weak memory. We show how to
instantiate this framework for Sequential Consistency (SC), Total Store Order (TSO), C++ …

In globally distributed systems, shared state is never perfect. When communication is neither
fast nor reliable, we cannot achieve strong consistency, low latency, and availability at the …

We present a technique for efficient stateless model checking of programs that execute
under the relaxed memory models TSO and PSO. The basis for our technique is a novel …

We present algorithms for checking and enforcing robustness of concurrent programs
against the Total Store Ordering (TSO) memory model. A program is robust if all its TSO …

Multiprocessors implement weak memory models, but program verifiers often assume
Sequential Consistency (SC), and thus may miss bugs due to weak memory. We propose a …

We present Dartagnan, a bounded model checker (BMC) for concurrent programs under
weak memory models. Its distinguishing feature is that the memory model is not …

We present the first framework for efficient application of stateless model checking (SMC) to
programs running under the relaxed memory model of POWER. The framework combines …

We propose an under-approximate reachability analysis algorithm for programs running
under the POWER memory model, in the spirit of the work on context-bounded analysis …

We present a method for automatic fence insertion in concurrent programs running under
weak memory models that provides the best known trade-off between efficiency and …

We address the problem of verifying safety properties of concurrent programs running over
the Total Store Order (TSO) memory model. Known decision procedures for this model are …