11 papers
Dynamic Data-Race Detection through the Fine-Grained Lens
Rucha Kulkarni, Umang Mathur, Andreas Pavlogiannis
Data races are among the most common bugs in concurrency. The standard approach to data-race detection is via dynamic analyses, which work over executions of concurrent programs, i…
Optimal Prediction of Synchronization-Preserving Races
Umang Mathur, Andreas Pavlogiannis, Mahesh Viswanathan
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 co…
Scalable Statistical Root Cause Analysis on App Telemetry
Vijayaraghavan Murali, Edward Yao, Umang Mathur +1
Despite engineering workflows that aim to prevent buggy code from being deployed, bugs still make their way into the Facebook app. When symptoms of these bugs, such as user submitt…
The Complexity of Dynamic Data Race Prediction
Umang Mathur, Andreas Pavlogiannis, Mahesh Viswanathan
Writing concurrent programs is notoriously hard due to scheduling non-determinism. The most common concurrency bugs are data races, which are accesses to a shared resource that can…
Atomicity Checking in Linear Time using Vector Clocks
Umang Mathur, Mahesh Viswanathan
Multi-threaded programs are challenging to write. Developers often need to reason about a prohibitively large number of thread interleavings to reason about the behavior of softwar…
What's Decidable About Program Verification Modulo Axioms?
Umang Mathur, P. Madhusudan, Mahesh Viswanathan
We consider the decidability of the verification problem of programs \emph{modulo axioms} --- that is, verifying whether programs satisfy their assertions, when the functions and r…