Author:
Yang Jiong,Meel Kuldeep S.
Abstract
AbstractThe problem of model counting, also known as $$\#\textsf{SAT}$$, is to compute the number of models or satisfying assignments of a given Boolean formula F. Model counting is a fundamental problem in computer science with a wide range of applications. In recent years, there has been a growing interest in using hashing-based techniques for approximate model counting that provide $$(\varepsilon , \delta )$$-guarantees: i.e., the count returned is within a $$(1+\varepsilon )$$-factor of the exact count with confidence at least $$1-\delta $$. While hashing-based techniques attain reasonable scalability for large enough values of $$\delta $$, their scalability is severely impacted for smaller values of $$\delta $$, thereby preventing their adoption in application domains that require estimates with high confidence.The primary contribution of this paper is to address the Achilles heel of hashing-based techniques: we propose a novel approach based on rounding that allows us to achieve a significant reduction in runtime for smaller values of $$\delta $$. The resulting counter, called $$\textsf{ApproxMC6}$$ (The resulting tool $$\textsf{ApproxMC6}$$ is available open-source at https://github.com/meelgroup/approxmc), achieves a substantial runtime performance improvement over the current state-of-the-art counter, $$\textsf{ApproxMC}$$. In particular, our extensive evaluation over a benchmark suite consisting of 1890 instances shows $$\textsf{ApproxMC6}$$ solves 204 more instances than $$\textsf{ApproxMC}$$, and achieves a $$4\times $$ speedup over $$\textsf{ApproxMC}$$.
Publisher
Springer Nature Switzerland
Reference30 articles.
1. Alur, R., et al.: Syntax-guided synthesis. In: Proceedings of FMCAD (2013)
2. Baluta, T., Shen, S., Shine, S., Meel, K.S., Saxena, P.: Quantitative verification of neural networks and its security applications. In: Proceedings of CCS (2019)
3. Beck, G., Zinkus, M., Green, M.: Automating the development of chosen ciphertext attacks. In: Proceedings of USENIX Security (2020)
4. Carter, J.L., Wegman, M.N.: Universal classes of hash functions. J. Comput. Syst. Sci. (1977)
5. Chakraborty, S., Fremont, D.J., Meel, K.S., Seshia, S.A., Vardi, M.Y.: Distribution-aware sampling and weighted model counting for SAT. In: Proceedings of AAAI (2014)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Automated Verifiability-Driven Design of Approximate Circuits: Exploiting Error Analysis;2024 Design, Automation & Test in Europe Conference & Exhibition (DATE);2024-03-25
2. Formally Certified Approximate Model Counting;Lecture Notes in Computer Science;2024