Despite many years of research, it has proven very difficult to develop a memory model for
concurrent programming languages that adequately balances the conflicting desiderata of …

Despite decades of research, we do not have a satisfactory concurrency semantics for any
general-purpose programming language that aims to support concurrent systems code. The …

Despite much research on concurrent programming languages, especially for Java and
C/C++, we still do not have a satisfactory definition of their semantics, one that admits all …

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

This is the first paper to propose a pure event structures model of relaxed memory. We
propose confusion-free event structures over an alphabet with a justification relation as a …

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 …

This paper develops an operational semantics for a release-acquire fragment of the C11
memory model with relaxed accesses. We show that the semantics is both sound and …

Eliminating so-called “out-of-thin-air”(OOTA) results is an open problem with many existing
programming language memory models including Java, C, and C++. OOTA behaviors are …

This paper studies information flow caused by speculation mechanisms in hardware and
software. The Spectre attack shows that there are practical information flow attacks which …

We propose a new approach to programming multi-core, relaxed-memory architectures in
imperative, portable programming languages. Our memory model is based on explicit …