Despite the numerous static and dynamic program analysis techniques in the literature, data
races remain one of the most common bugs in modern concurrent software. Further, the …

Data races are among the most reliable indicators of programming errors in concurrent
software. For at least two decades, Lamport's happens-before (HB) relation has served as …

Writing reliable concurrent software remains a huge challenge for today's programmers.
Programmers rarely reason about their code by explicitly considering different possible inter …

We present maximal causality reduction (MCR), a new technique for stateless model
checking. MCR systematically explores the state-space of concurrent programs with a …

Symbolic execution is a systematic technique for checking programs, which forms a basis for
various software testing and verification techniques. It provides a powerful analysis in …

Debugging—the process of identifying, localizing and fixing bugs—is a key activity in
software development. Due to issues such as non-determinism and difficulties of …

Deadlocks still severely inflict reliability and security issues upon software systems of the
modern age. Worse still, as we note, in prior static deadlock detectors, good precision does …

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 …

Writing concurrent programs is highly error-prone due to the nondeterminism in interprocess
communication. The most reliable indicators of errors in concurrency are data races, which …

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 …