16 citations · 30 across the 4 of their papers we have counts for
4 papers
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…
Using non-convex approximations for efficient analysis of timed automata
Frédéric Herbreteau, Dileep Kini, B. Srivathsan +1
The reachability problem for timed automata asks if there exists a path from an initial state to a target state. The standard solution to this problem involves computing the zone g…