7 citations · 32 across the 13 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.LO2014★ 3 cited
Approximate Counting in SMT and Value Estimation for Probabilistic Programs
Dmitry Chistikov, Rayna Dimitrova, Rupak Majumdar
#SMT, or model counting for logical theories, is a well-known hard problem that generalizes such tasks as counting the number of satisfying assignments to a Boolean formula and com…
cs.FL2014★ 1 cited
Unary Pushdown Automata and Straight-Line Programs
Dmitry Chistikov, Rupak Majumdar
We consider decision problems for deterministic pushdown automata over a unary alphabet (udpda, for short). Udpda are a simple computation model that accept exactly the unary regul…