Diagnosing software failures in the field is notoriously difficult, in part due to the fundamental
complexity of troubleshooting any complex software system, but further exacerbated by the …

Bugs in multi-threaded programs often arise due to data races. Numerous static and
dynamic program analysis techniques have been proposed to detect data races. We …

Data races occur when multiple threads are about to access the same piece of memory, and
at least one of those accesses is a write. Such races can lead to hard-to-reproduce bugs that …

Many current program analyses require highly precise pointer information about small,
targeted parts of a given program. This motivates the need for demand-driven pointer …

Concurrency fault are difficult to find because they usually occur under specific thread
interleavings. Fault-detection tools in this area find data-access patterns among thread …

We present an effective static deadlock detection algorithm for Java. Our algorithm uses a
novel combination of static analyses each of which approximates a different necessary …

This paper identifies and formalizes a prevalent class of asymptotic performance bugs called
redundant traversal bugs and presents a novel static analysis for automatically detecting …

Atomicity is an important specification that enables programmers to understand atomic
blocks of code in a multi-threaded program as if they are sequential. This significantly …

We present new techniques for fast, accurate and scalable static data race detection in
concurrent programs. Focusing our analysis on Linux device drivers allowed us to identify …

Locksmith is a static analysis tool for automatically detecting data races in C programs. In
this article, we describe each of Locksmith's component analyses precisely, and present …