26 citations · 137 across the 24 of their papers we have counts for
11 papers · 1 filter
Dynamic Race Detection With O(1) Samples
Mosaad Al Thokair, Minjian Zhang, Umang Mathur +1
Happens before-based dynamic analysis is the go-to technique for detecting data races in large scale software projects due to the absence of false positive reports. However, such a…
Sound Dynamic Deadlock Prediction in Linear Time
Hünkar Can Tunç, Umang Mathur, Andreas Pavlogiannis +1
Deadlocks are one of the most notorious concurrency bugs, and significant research has focused on detecting them efficiently. Dynamic predictive analyses work by observing concurre…
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…
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…
Decidable Synthesis of Programs with Uninterpreted Functions
Paul Krogmeier, Umang Mathur, Adithya Murali +2
We identify a decidable synthesis problem for a class of programs of unbounded size with conditionals and iteration that work over infinite data domains. The programs in our class…
Deciding Memory Safety for Single-Pass Heap-Manipulating Programs
Umang Mathur, Adithya Murali, Paul Krogmeier +2
We investigate the decidability of automatic program verification for programs that manipulate heaps, and in particular, decision procedures for proving memory safety for them. We…
Decidable Verification of Uninterpreted Programs
Umang Mathur, P. Madhusudan, Mahesh Viswanathan
We study the problem of completely automatically verifying uninterpreted programs---programs that work over arbitrary data models that provide an interpretation for the constants,…
What Happens - After the First Race? Enhancing the Predictive Power of Happens - Before Based Dynamic Race Detection
Umang Mathur, Dileep Kini, Mahesh Viswanathan
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 probl…
Data Race Detection on Compressed Traces
Dileep Kini, Umang Mathur, Mahesh Viswanathan
We consider the problem of detecting data races in program traces that have been compressed using straight line programs (SLP), which are special context-free grammars that generat…
Dynamic Race Prediction in Linear Time
Dileep Kini, Umang Mathur, Mahesh Viswanathan
Writing reliable concurrent software remains a huge challenge for today's programmers. Programmers rarely reason about their code by explicitly considering different possible inter…