30 citations · 31 across the 4 of their papers we have counts for
5 papers
Pushdown Model Checking Above the Cubic Bottleneck
A. R. Balasubramanian, Dmitry Chistikov, Rupak Majumdar
Many problems in the verification of recursive programs can be reduced to pushdown model checking. In this problem, we are given as input a pushdown automaton (PDA) over a constant…
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…
General Decidability Results for Systems with Continuous Counters
A. R. Balasubramanian, Matthew Hague, Rupak Majumdar +2
Counters that hold natural numbers are ubiquitous in modeling and verifying software systems; for example, they model dynamic creation and use of resources in concurrent programs.…
Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification
Chih-Duo Hong, Anthony W. Lin, Philipp Rümmer +1
Bisimulation is crucial for verifying process equivalence in probabilistic systems. This paper presents a novel logical framework for analyzing bisimulation in probabilistic parame…
Parameterized Verification of Asynchronous Shared-Memory Systems
Javier Esparza, Pierre Ganty, Rupak Majumdar
We characterize the complexity of the safety verification problem for parameterized systems consisting of a leader process and arbitrarily many anonymous and identical contributors…