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. Unlike most previous approaches, which enumerate thread interleavings up to some partial order reduction improvements, our approach works directly on execution graphs and (in the absence of RMW instructions and SC atomics) avoids redundant exploration by construction. We have implemented a model checker, called RCMC, based on this approach and applied it to a number of challenging concurrent programs. Our experiments confirm that RCMC is significantly faster, scales better than other model checking tools, and is also more resilient to small changes in the benchmarks.
Similarly, the work by Kokologiannakis et al. REF presents RCMC, a model checker that uses execution graphs within C++11 memory models to avoid redundant exploration of concurrent programs.
Effective stateless model checking for C/C++ concurrency
PACMPL
Computer Science