CoqQFBV: A Scalable Certified SMT Quantifier-Free Bit-Vector Solver-Reference-Cited by-同舟云学术

CoqQFBV: A Scalable Certified SMT Quantifier-Free Bit-Vector Solver

Published:2021 Issue: Volume: Page:149-171
ISSN:0302-9743
Container-title:Computer Aided Verification
language:
Short-container-title:

Author:

Shi Xiaomu,Fu Yu-Fu,Liu Jiaxiang,Tsai Ming-Hsien,Wang Bow-Yaw,Yang Bo-Yin

Abstract

AbstractWe present a certified SMT QF_BV solver CoqQFBV built from a verified bit blasting algorithm, Kissat, and the verified SAT certificate checker GratChk in this paper. Our verified bit blasting algorithm supports the full QF_BV logic of SMT-LIB; it is specified and formally verified in the proof assistant Coq . We compare CoqQFBV with CVC4, Bitwuzla, and Boolector on benchmarks from the QF_BV division of the single query track in the 2020 SMT Competition, and real-world cryptographic program verification problems. CoqQFBV surprisingly solves more program verification problems with certification than the 2020 SMT QF_BV division winner Bitwuzla without certification.

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-81688-9_7

Reference31 articles.

1. Aranha, D.F., Gouvêa, C.P.L., Markmann, T., Wahby, R.S., Liao, K.: RELIC is an Efficient LIbrary for Cryptography. https://github.com/relic-toolkit/relic

2. Barbosa, H., Hoenicke, J., Hyvarinen, A.: International Satisfiability Modulo Theories Competition (SMT-COMP) (2020). https://smt-comp.github.io/2020/

3. Barrett, C., Stump, A., Tinelli, C.: The SMT-LIB Standard: Version 2.6. Technical report, Department of Computer Science, The University of Iowa (2017). http://smtlib.cs.uiowa.edu/papers/smt-lib-reference-v2.6-r2017-07-18.pdf

4. Lecture Notes in Computer Science;C Barrett,2011

5. Biere, A., Fazekas, K., Fleury, M., Heisinger, M.: CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT competition 2020. In: Balyo, T., Froleyks, N., Heule, M., Iser, M., Järvisalo, M., Suda, M. (eds.) SAT Competition 2020 - Solver and Benchmark Descriptions. B, vol. B-2020-1, pp. 50–53. University of Helsinki (2020)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Regular Abstractions for Array Systems;Proceedings of the ACM on Programming Languages;2024-01-05

2. Formally Certified Approximate Model Counting;Lecture Notes in Computer Science;2024

3. Formal Verification of Bit-Vector Invertibility Conditions in Coq;Frontiers of Combining Systems;2023

4. Certified Verification for Algebraic Abstraction;Computer Aided Verification;2023

5. BFF: foundational and automated verification of bitfield-manipulating programs;Proceedings of the ACM on Programming Languages;2022-10-31