While current bug detection techniques for concurrent software focus on unearthing low-
level issues such as data races or deadlocks, they often fall short of discovering more …

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 are notoriously hard to write correctly, as scheduling nondeterminism
introduces subtle errors that are both hard to detect and to reproduce. The most common …

Predictive analysis aims at detecting concurrency errors during runtime by monitoring a
concrete execution trace of a concurrent program. In recent years, various models based on …

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 …

We propose a symbolic algorithm to accurately predict atomicity violations by analyzing a
concrete execution trace of a concurrent program. We use both the execution trace and the …

Triggering errors in concurrent programs is a notoriously difficult task. A key reason for this is
the behavioral complexity resulting from the large number of interleavings of operations of …

In this paper we present a precise data race detection technique for distributed memory
parallel programs. Our technique, which we call Active Testing, builds on our previous work …

We study the problem of determining, given a run of a concurrent program, whether there is
any alternate execution of it that violates atomicity, where atomicity is defined using marked …

Concurrent programs proliferate as multi-core technologies advance. The regression testing
of concurrent programs often requires running a failing test for weeks before catching a …