1 citations · 1 across the 5 of their papers we have counts for
7 papers
CSB: A Counting and Sampling tool for Bit-vectors
Arijit Shaw, Kuldeep S. Meel
Satisfiability modulo theory (SMT) solvers have significantly advanced automated reasoning due to their effectiveness in solving problems across various fields. With the advancemen…
Efficient Volume Computation for SMT Formulas
Arijit Shaw, Uddalok Sarkar, Kuldeep S. Meel
Satisfiability Modulo Theory (SMT) has recently emerged as a powerful tool for solving various automated reasoning problems across diverse domains. Unlike traditional satisfiabilit…
Approximate SMT Counting Beyond Discrete Domains
Arijit Shaw, Kuldeep S. Meel
Satisfiability Modulo Theory (SMT) solvers have advanced automated reasoning, solving complex formulas across discrete and continuous domains. Recent progress in propositional mode…
Model Counting in the Wild
Arijit Shaw, Kuldeep S. Meel
Model counting is a fundamental problem in automated reasoning with applications in probabilistic inference, network reliability, neural network verification, and more. Although mo…
An Approximate Skolem Function Counter
Arijit Shaw, Brendan Juba, Kuldeep S. Meel
One approach to probabilistic inference involves counting the number of models of a given Boolean formula. Here, we are interested in inferences involving higher-order objects, i.e…
Explaining SAT Solving Using Causal Reasoning
Jiong Yang, Arijit Shaw, Teodora Baluta +2
The past three decades have witnessed notable success in designing efficient SAT solvers, with modern solvers capable of solving industrial benchmarks containing millions of variab…
Designing New Phase Selection Heuristics
Arijit Shaw, Kuldeep S. Meel
CDCL-based SAT solvers have transformed the field of automated reasoning owing to their demonstrated efficiency at handling problems arising from diverse domains. The success of CD…