2017/12/21 by Seonmo Kim, Kim, Seonmo, Stephen McCamant +1 · 2 citations
Computer Science · #Artificial Intelligence (cs.AI) #Cryptography and Data Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Formal Methods in Verification #Privacy-Preserving Technologies in Data #cs.AI #cs.CR
paper · pdf · doi:10.48550/arxiv.1712.07770
arxiv created 2017/12/21 · openalex publication_date 2017/12/21 · arxiv updated 2017/12/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Approximate model counting for bit-vector SMT formulas (generalizing #SAT) has many applications such as probabilistic inference and quantitative information-flow security, but it is computationally difficult. Adding random parity constraints (XOR streamlining) and then checking satisfiability is an effective approximation technique, but it requires a prior hypothesis about the model count to produce useful results. We propose an approach inspired by statistical estimation to continually refine a probabilistic estimate of the model count for a formula, so that each XOR-streamlined query yields as much information as possible. We implement this approach, with an approximate probability model, as a wrapper around an off-the-shelf SMT solver or SAT solver. Experimental results show that the implementation is faster than the most similar previous approaches which used simpler refinement strategies. The technique also lets us model count formulas over floating-point constraints, which we demonstrate with an application to a vulnerability in differential privacy mechanisms.