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 …

Multi-threaded programs are challenging to write. Developers often need to reason about a
prohibitively large number of thread interleavings to reason about the behavior of software …

Happens before-based dynamic analysis is the go-to technique for detecting data races in
large scale software projects due to the absence of false positive reports. However, such …

Data race is one of the most common concurrency issues in OS kernels, and it can cause
severe problems like system crashes and privilege escalation. Therefore, detecting kernel …

Data races seriously threaten the correctness of concurrent programs. Earlier works can
report false positives. Recently, trace-based predictive analysis has achieved sound results …

It was recently proved that any SLP generating a given string w can be transformed in linear
time into an equivalent balanced SLP of the same asymptotic size. We show that this result …

Trace theory (formulated by Mazurkiewicz in 1987) is a principled framework for defining
equivalence relations for concurrent program runs based on a commutativity relation over …

We present an alternative proof of the NEXP-hardness of the satisfiability of Dependency
Quantified Boolean Formulas (DQBF). Besides being simple, our proof also gives us a …

This article presents a static deadlock analysis for single-path MPI programs. Deadlock is
when processes are blocked indefinitely by a circular communication dependency. A single …

Thread Sharing Analysis (TSA) plays an important role in concurrent program testing.
Providing a TSA to a data race detector may speed up the runtime logging and improve the …