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 …

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 …

Automatic static detection of data races is one of the most basic problems in reasoning about
concurrency. We present RacerD—a static program analysis for detecting data races in Java …

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 …

Bugs due to data races in multithreaded programs often exhibit non-deterministic symptoms
and are notoriously difficult to find. This paper describes RaceTrack, a dynamic race …

Data races are one of the most common and subtle causes of pernicious concurrency bugs.
Static techniques for preventing data races are overly conservative and do not scale well to …

We present a new method for dynamically detecting potential data races in multithreaded
programs. Our method improves on the state of the art in accuracy, in usability, and in …

This paper introduces a new dynamic data race detector, acculock, to detect data races in
Java programs. acculock is the first hybrid detector that combines lockset and epoch‐based …

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