7 citations · 27 across the 17 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020★ 5 cited
Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice
Kuldeep S. Meel, S. Akshay
Given a CNF formula F on n variables, the problem of model counting or #SAT is to compute the number of satisfying assignments of F . Model counting is a fundamental but hard probl…
cs.FL2020★ 2 cited
Revisiting Underapproximate Reachability for Multipushdown Systems
S. Akshay, Paul Gastin, S Krishna +1
Boolean programs with multiple recursive threads can be captured as pushdown automata with multiple stacks. This model is Turing complete, and hence, one is often interested in ana…