Relaxed memory consistency models are common and essential when multiple processes
share a single global address space, such as when using multicore CPUs, distributed …

Existing multi-threaded applications perform synchronization either in an explicit way, eg,
making use of the functionality provided by synchronization libraries or in an implicit or" …

We address the state reachability problem in concurrent programs running over the TSO
weak memory model. This problem has been shown to be decidable with non-primitive …

We show how partial redundancy elimination (PRE) can be instantiated to perform provably
correct fence elimination for multi-threaded programs running on top of the x86, ARM and …

Abstract Model checkers frequently fail to completely verify a concurrent program, even if
partial-order reduction is applied. The verification engineer is left in doubt whether the …

We present an extended version of the model checking modulo theories framework for
verifying parameterized systems under the TSO weak memory model. Our extension relies …

We describe a program logic for weak memory (also known as relaxed memory). The logic is
based on Hoare logic within a thread, and rely/guarantee between threads. It is presented …

While relaxed memory consistency models contribute optimizations of compilers on
multicore CPUs and shared memory distributed programming languages, their relaxedness …

When targeting modern parallel hardware architectures, constructing correct and high-
performing software is complex and time-consuming. In particular, reorderings of memory …

We present PMCx86, a compiler from x86 concurrent programs to Cubicle-W, a model
checker for parameterized weak memory array-based transition systems. Our tool handles …