26 citations · 137 across the 24 of their papers we have counts for
6 papers · 1 filter
Deciding Accuracy of Differential Privacy Schemes
Gilles Barthe, Rohit Chadha, Paul Krogmeier +2
Differential privacy is a mathematical framework for developing statistical computations with provable guarantees of privacy and accuracy. In contrast to the privacy component of d…
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…
Verifying Stochastic Hybrid Systems with Temporal Logic Specifications via Model Reduction
Yu Wang, Nima Roohi, Matthew West +2
We present a scalable methodology to verify stochastic hybrid systems. Using the Mori-Zwanzig reduction method, we construct a finite state Markov chain reduction of a given stocha…
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…
Statistically Model Checking PCTL Specifications on Markov Decision Processes via Reinforcement Learning
Yu Wang, Nima Roohi, Matthew West +2
Probabilistic Computation Tree Logic (PCTL) is frequently used to formally specify control objectives such as probabilistic reachability and safety. In this work, we focus on model…
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…