GenMC is an LLVM-based state-of-the-art stateless model checker for concurrent C/C++
programs. Its modular infrastructure allows it to support complex memory models, such as …

This paper introduces ctrees, a monad for modeling nondeterministic, recursive, and impure
programs in Coq. Inspired by **a et al.'s itrees, this novel data structure embeds …

Several functional correctness criteria have been proposed for relaxed-memory consistency
libraries, but most lack support for modular client reasoning. Mével and Jourdan recently …

While causal consistency is one of the most fundamental consistency models weaker than
sequential consistency, the decidability of safety verification for (finite-state) concurrent …

This paper provides a novel approach to reconciling complex low-level memory model
features, such as pointer--integer casts, with desired refinements that are needed to justify …

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 …

The emergence of new architectures create a recurring challenge to ensure that existing
programs still work on them. Manually porting legacy code is often impractical. Static binary …

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 …

Existing semantic formalisations of the Intel-x86 architecture cover only a small fragment of
its available features that are relevant for the consistency semantics of multi-threaded …

Remote direct memory access (RDMA) is a modern technology enabling networked
machines to exchange information without involving the operating system of either side, and …