Maximally Stateless Model Checking for Concurrent Bugs under Relaxed Memory Models

Concurrency improves the performance of software significantly. However, writing concurrent programs is error prone, especially under relaxed memory models, such as TSO and PSO. Although careful synchronizations used, it is still difficult to totally eliminate concurrency bugs due to the huge state space of interleavings that a concurrent program can generate. One promising solution to this problem is stateless model checking by systematically exploring the state-space of the concurrent programs. We present a maximal and sound model checker for verifying concurrent programs under TSO and PSO. The key idea of our technique is to relax the happens-before relation of the operations from the same thread.