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
We propose a new method for reducing the interleaving space dur-ing stateless model checking of mult...
This paper addresses the problem of automatically verifying correctness of concurrent algorithms, e....
Concurrent programs are notoriously difficult to write correctly, as scheduling nondeterminism can i...
We present a stateless model checking algorithm for verifying concurrent programs running under RC11...
We present a framework for the efficient application of stateless model checking (SMC) to concurrent...
Concurrency libraries can facilitate the development of multi-threaded programs by providing concurr...
Stateless Model Checking (SMC) is a verification technique for concurrent programs that checks for s...
Formal verification of multithreaded software running on multi-core hardware has for long been chall...
Concurrent programs are ubiquitous, from the high-end servers to personal machines, due to the fact ...
Abstract We present maximal causality reduction (MCR), a new technique for stateless model checking....
We present a new approach for stateless model checking (SMC) of multithreaded programs under Sequent...
Abstract. We propose a SAT-based bounded verification technique, called TCBMC, for threaded C progra...
Abstract. Bounded model checking (BMC) has successfully been used for many practical program verific...
We present a new approach for stateless model checking (SMC) of multithreaded programs under Sequent...
Stateless model checking is a technique for testing and verifying concurrent programs, based on expl...
We propose a new method for reducing the interleaving space dur-ing stateless model checking of mult...
This paper addresses the problem of automatically verifying correctness of concurrent algorithms, e....
Concurrent programs are notoriously difficult to write correctly, as scheduling nondeterminism can i...
We present a stateless model checking algorithm for verifying concurrent programs running under RC11...
We present a framework for the efficient application of stateless model checking (SMC) to concurrent...
Concurrency libraries can facilitate the development of multi-threaded programs by providing concurr...
Stateless Model Checking (SMC) is a verification technique for concurrent programs that checks for s...
Formal verification of multithreaded software running on multi-core hardware has for long been chall...
Concurrent programs are ubiquitous, from the high-end servers to personal machines, due to the fact ...
Abstract We present maximal causality reduction (MCR), a new technique for stateless model checking....
We present a new approach for stateless model checking (SMC) of multithreaded programs under Sequent...
Abstract. We propose a SAT-based bounded verification technique, called TCBMC, for threaded C progra...
Abstract. Bounded model checking (BMC) has successfully been used for many practical program verific...
We present a new approach for stateless model checking (SMC) of multithreaded programs under Sequent...
Stateless model checking is a technique for testing and verifying concurrent programs, based on expl...
We propose a new method for reducing the interleaving space dur-ing stateless model checking of mult...
This paper addresses the problem of automatically verifying correctness of concurrent algorithms, e....
Concurrent programs are notoriously difficult to write correctly, as scheduling nondeterminism can i...