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 …

We present CLAP, a new technique to reproduce concurrency bugs. CLAP has two key
steps. First, it logs thread local execution paths at runtime. Second, offline, it computes …

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 …

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

Data race is one of the most dangerous errors in multithreaded programming, and despite
intensive studies, it remains a notorious cause of failures in concurrent systems. Detecting …

Controlled concurrency testing (CCT) techniques have been shown promising for
concurrency bug detection. Their key insight is to control the order in which threads get …

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 …

Shared-memory multi-threaded programs are notoriously difficult to test, and because of the
often astronomically large number of thread schedules, testing all possible interleavings is …

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 …

Analyzing multi-threaded programs is hard due to the number of thread interleavings. Partial
orders can be used for modeling and analyzing multi-threaded programs. However, there is …