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

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 …

Bounded model checking (BMC) has successfully been used for many practical program
verification problems, but concurrency still poses a challenge. Here we describe a new …

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 address the verification of concurrent programs running under the release-acquire (RA)
semantics. We show that the reachability problem is undecidable even in the case where the …

We design an invariance proof method for concurrent programs parameterised by a weak
consistency model. The calculational design of the invariance proof method is by abstract …

In this article, we propose an approach to program verification using an abstract
characterisation of weak memory models. Our approach is based on a hierarchical axiom …

Distributed storage systems and databases are widely used by various types of applications.
Transactional access to these storage systems is an important abstraction allowing …

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

We investigate the decidability of the state reachability problem in finite-state programs
running under weak memory models. In [3], we have shown that this problem is decidable …