Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: DRAT-based Bit-Vector Proofs in CVC4   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.

5
The categories of this paper are: gr-qc
29
The categories of this paper are: funct-an
16
The categories of this paper are: stat
34
The categories of this paper are: chem-ph
0
The categories of this paper are: hep-ph
37
The categories of this paper are: supr-con
7
The categories of this paper are: hep-th
26
The categories of this paper are: bayes-an
8
The categories of this paper are: hep-ex
20
The categories of this paper are: acc-phys
9
The categories of this paper are: nlin
15
The categories of this paper are: nucl-ex
18
The categories of this paper are: econ
22
The categories of this paper are: chao-dyn
17
The categories of this paper are: q-fin
36
The categories of this paper are: cmp-lg