Concurrency bugs are hard to find, reproduce, and debug. They often escape rigorous in-
house testing, but result in large-scale outages in production. Existing concurrency-bug …

Concurrency bugs are extremely difficult to detect. Recently, several dynamic techniques
achieve sound analysis. M2 is even complete for two threads. It is designed to decide …

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 …

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 …

Recent research on parallel functional programming has culminated in a provably efficient
(in work and space) parallel memory manager, which has been incorporated into the MPL …

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 …

Memory corruption vulnerabilities can occur in multithreaded executions, known as
concurrency vulnerabilities in this paper. Due to non-deterministic multithreaded executions …

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 …

Concurrent programs are still prone to bugs arising from the subtle interleavings of threads.
Traditional static analysis for concurrent programs, such as data-flow analysis and symbolic …

Dynamic race detection is the problem of determining if an observed program execution
reveals the presence of a data race in a program. The classical approach to solving this …