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

Geographically distributed systems often rely on replicated eventually consistent data stores
to achieve availability and performance. To resolve conflicting updates at different replicas …

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 introduce relaxed separation logic (RSL), the first program logic for reasoning about
concurrent programs running under the C11 relaxed memory model. From a user's …

JavaScript is the most widely used web language for client-side applications. Whilst the
development of JavaScript was initially just led by implementation, there is now increasing …

Weak memory models formalize the inconsistent behaviors that one can expect to observe
in multithreaded programs running on modern hardware. In so doing, however, they …

We show that the weak memory model introduced by the 2011 C and C++ standards does
not permit many common source-to-source program transformations (such as expression …

Writing low-level concurrent software has traditionally required intimate knowledge of the
entire toolchain and often has involved coding in assembly. New language standards have …

Modern distributed systems often rely on databases that achieve scalability by providing
only weak guarantees about the consistency of distributed transaction processing. The …

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 …