We present a stateless model checking algorithm for verifying concurrent programs running
under RC11, a repaired version of the C/C++ 11 memory model without dependency cycles …

We present a technique for efficient stateless model checking of programs that execute
under the relaxed memory models TSO and PSO. The basis for our technique is a novel …

We present GenMC, a model checking algorithm for concurrent programs that is parametric
in the choice of memory model and can be used for verifying clients of concurrent libraries …

A memory consistency model (MCM) is the part of a programming language or computer
architecture specification that defines which values can legally be read from shared memory …

We present a framework for the efficient application of stateless model checking (SMC) to
concurrent programs running under the Release-Acquire (RA) fragment of the C/C++ 11 …

Persistent memory (PM) technologies combine near DRAM performance with persistency
and open the possibility of using one copy of a data structure as both a working copy and a …

Implementing highly efficient and correct synchronization primitives on modern Weak
Memory Model (WMM) architectures, such as ARM and RISC-V, is very difficult even for …

A memory consistency model specifies which writes to shared memory a given read may
see. Ambiguities or errors in these specifications can lead to bugs in both compilers and …

We present a new dynamic partial-order reduction method for stateless model checking of
concurrent programs. A common approach for exploring program behaviors relies on …

We present the first framework for efficient application of stateless model checking (SMC) to
programs running under the relaxed memory model of POWER. The framework combines …