@inproceedings{5e140294cb614bc9b3e6bfc126c7266a,
title = "DRAT-based Bit-Vector Proofs in CVC4",
abstract = "Many state-of-the-art Satisfiability Modulo Theories (SMT) solvers for the theory of fixed-size bit-vectors employ an approach called bit-blasting, where a given formula is translated into a Boolean satisfiability (SAT) problem and delegated to a SAT solver. Consequently, producing bit-vector proofs in an SMT solver requires incorporating SAT proofs into its proof infrastructure. In this paper, we describe three approaches for integrating DRAT proofs generated by an off-the-shelf SAT solver into the proof infrastructure of the SMT solver CVC4 and explore their strengths and weaknesses. We implemented all three approaches using CryptoMiniSat as the SAT back-end for its bit-blasting engine and evaluated performance in terms of proof-production and proof-checking.",
author = "Alex Ozdemir and Aina Niemetz and Mathias Preiner and Yoni Zohar and Clark Barrett",
note = "Publisher Copyright: {\textcopyright} 2019, Springer Nature Switzerland AG.; 22nd International Conference on Theory and Applications of Satisfiability Testing, SAT 2019 ; Conference date: 09-07-2019 Through 12-07-2019",
year = "2019",
doi = "10.1007/978-3-030-24258-9_21",
language = "الإنجليزيّة",
isbn = "9783030242572",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "298--305",
editor = "Mikol{\'a}{\v s} Janota and In{\^e}s Lynce",
booktitle = "Theory and Applications of Satisfiability Testing – SAT 2019 - 22nd International Conference, SAT 2019, Proceedings",
address = "ألمانيا",
}