Optimal stateless model checking for reads-from equivalence under sequential consistency
Authors:
Open Access
- 10 October 2019
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 3 (OOPSLA) , 1-29
Abstract
We present a new approach for stateless model checking (SMC) of multithreaded programs under Sequential Consistency (SC) semantics. To combat state-space explosion, SMC is often equipped with a partial-order reduction technique, which defines an equivalence on executions, and only needs to explore one execution in each equivalence class. Recently, it has been observed that the commonly used equivalence of Mazurkiewicz traces can be coarsened but still cover all program crashes and assertion violations. However, for this coarser equivalence, which preserves only the reads-from relation from writes to reads, there is no SMC algorithm which is (i) optimal in the sense that it explores precisely one execution in each reads-from equivalence class, and (ii) efficient in the sense that it spends polynomial effort per class. We present the first SMC algorithm for SC that is both optimal and efficient in practice , meaning that it spends polynomial time per equivalence class on all programs that we have tried. This is achieved by a novel test that checks whether a given reads-from relation can arise in some execution. We have implemented the algorithm by extending Nidhugg, an SMC tool for C/C++ programs, with a new mode called rfsc. Our experimental results show that Nidhugg/rfsc, although slower than the fastest SMC tools in programs where tools happen to examine the same number of executions, always scales similarly or better than them, and outperforms them by an exponential factor in programs where the reads-from equivalence is coarser than the standard one. We also present two non-trivial use cases where the new equivalence is particularly effective, as well as the significant performance advantage that Nidhugg/rfsc offers compared to state-of-the-art SMC and systematic concurrency testing tools.Keywords
Funding Information
- Vetenskapsrådet (621-2017-04812)
- Stiftelsen för Strategisk Forskning (aSSIsT)
This publication has 35 references indexed in Scilit:
- Maximal Causal Models for Sequentially Consistent Systems2013
- A Race-Detection and Flipping Algorithm for Automated Testing of Multi-threaded Programs2007
- Software Model Checking: The VeriSoft ApproachFormal Methods in System Design, 2005
- Detecting Errors in Multithreaded Programs by Generalized Predictive Analysis of Executions2005
- State space reduction using partial order techniquesInternational Journal on Software Tools for Technology Transfer, 1999
- Testing Shared MemoriesSIAM Journal on Computing, 1997
- All from one, one for all: on model checking using representatives1993
- Stubborn sets for reduced state space generation1991
- Trace theory1987
- On observing nondeterminism and concurrency1980