Relaxed memory models must simultaneously achieve efficient implementability and thread-
compositional reasoning. Is that why they have become so complicated? We argue that the …

Program logics and semantics tell a pleasant story about sequential composition: when
executing (S1; S2), we first execute S1 then S2. To improve performance, however …

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 …

Very relaxed concurrency memory models, like those of the Arm-A, RISC-V, and IBM Power
hardware architectures, underpin much of computing but break a fundamental intuition …

Deductive verification techniques for C11 programs have advanced significantly in recent
years with the development of operational semantics and associated logics for increasingly …

We investigate the problem of developing an" in-order" shared-memory concurrency model
for languages like C and C++, which executes instructions following their program order …

We present a compositional denotational semantics for a functional language with first-class
parallel composition and shared-memory operations whose operational semantics follows …

Local data-race-freedom guarantees, ensuring strong semantics for locations accessed by
non-racy instructions, provide a fruitful methodology for modular reasoning in relaxed …

Weak memory presents a new challenge for program verification and has resulted in the
development of a variety of specialised logics. For C11-style memory models, our previous …

We formally show that sequential reasoning is adequate and sufficient for establishing
soundness of various compiler optimizations under weakly consistent shared-memory …