1 citations · 1 across the 4 of their papers we have counts for
4 papers
Parametrizing Reads-From Equivalence for Predictive Monitoring
Azadeh Farzan, Umang Mathur
Predictive runtime monitoring asks whether an execution of a concurrent program can be used to \emph{soundly predict} the existence of a reordering of that satisfies a…
State Space Estimation for DPOR-based Model Checkers(Extended Version)
A. R. Balasubramanian, Mohammad Hossein Khoshechin Jorshari, Rupak Majumdar +2
We study the estimation problem for concurrent programs: given a bounded program , estimate the number of Mazurkiewicz trace-equivalence classes induced by its interleavings. Th…
Counting and Sampling Traces in Regular Languages
Alexis de Colnet, Kuldeep S. Meel, Umang Mathur
In this work, we study the problems of counting and sampling Mazurkiewicz traces that a regular language touches. Fix an alphabet and an independence relation $\mathbb{I} \subs…
A faster FPRAS for #NFA
Kuldeep S. Meel, Sourav Chakraborty, Umang Mathur
Given a non-deterministic finite automaton (NFA) A with m states, and a natural number n (presented in unary), the #NFA problem asks to determine the size of the set L(A_n) of word…