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++ …

Modern architectures rely on memory fences to prevent undesired weakenings of memory
consistency. As the fences' semantics may be subtle, the automation of their placement is …

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 …

This paper reports progress in verification tool engineering for weak memory models. We
present two bounded model checking tools for concurrent programs. Their distinguishing …

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 …

We address the problem of verifying safety properties of concurrent programs running over
the TSO memory model. Known decision procedures for this model are based on complex …

Programming environments for sequential programs provide strong debugging support.
However, concurrent programs, especially under relaxed memory models, lack powerful …

We give a sound and complete procedure for fence insertion for concurrent finite-state
programs running under the PSO memory model. This model allows “write to read” and …

Modern architectures provide weaker memory consistency guarantees than sequential
consistency. These weaker guarantees allow programs to exhibit behaviours where the …

We present Cubicle-W, a new version of the Cubicle model checker to verify parameterized
systems under weak memory models. Its main originality is to implement a backward …