Optimal dynamic partial order reduction
Stateless model checking is a powerful technique for program verification, which however
suffers from an exponential growth in the number of explored executions. A successful …
suffers from an exponential growth in the number of explored executions. A successful …
Stateless model checking for TSO and PSO
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 …
under the relaxed memory models TSO and PSO. The basis for our technique is a novel …
Optimal stateless model checking under the release-acquire semantics
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 …
concurrent programs running under the Release-Acquire (RA) fragment of the C/C++ 11 …
Jaaru: Efficiently model checking persistent memory programs
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 …
and open the possibility of using one copy of a data structure as both a working copy and a …
Data-centric dynamic partial order reduction
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 …
concurrent programs. A common approach for exploring program behaviors relies on …
Stateless model checking for POWER
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 …
programs running under the relaxed memory model of POWER. The framework combines …
Source sets: A foundation for optimal dynamic partial order reduction
Stateless model checking is a powerful method for program verification that, however,
suffers from an exponential growth in the number of explored executions. A successful …
suffers from an exponential growth in the number of explored executions. A successful …
Value-centric dynamic partial order reduction
The verification of concurrent programs remains an open challenge, as thread interaction
has to be accounted for, which leads to state-space explosion. Stateless model checking …
has to be accounted for, which leads to state-space explosion. Stateless model checking …
Using unfoldings in automated testing of multithreaded programs
In multithreaded programs both environment input data and the nondeterministic
interleavings of concurrent events can affect the behavior of the program. One approach to …
interleavings of concurrent events can affect the behavior of the program. One approach to …
Unfolding based automated testing of multithreaded programs
In multithreaded programs both environment input data and the nondeterministic
interleavings of concurrent events can affect the behavior of the program. One approach to …
interleavings of concurrent events can affect the behavior of the program. One approach to …