9 papers · 1 filter
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…
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…