DRAT-based Bit-Vector Proofs in CVC4

Alex Ozdemir; Aina Niemetz; Mathias Preiner; Yoni Zohar; Clark Barrett

doi:10.1007/978-3-030-24258-9_21

DRAT-based Bit-Vector Proofs in CVC4

Alex Ozdemir, Aina Niemetz, Mathias Preiner, Yoni Zohar, Clark Barrett

Stanford University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

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.

Original language	English
Title of host publication	Theory and Applications of Satisfiability Testing – SAT 2019 - 22nd International Conference, SAT 2019, Proceedings
Editors	Mikoláš Janota, Inês Lynce
Publisher	Springer Verlag
Pages	298-305
Number of pages	8
ISBN (Print)	9783030242572
DOIs	https://doi.org/10.1007/978-3-030-24258-9_21
State	Published - 2019
Externally published	Yes
Event	22nd International Conference on Theory and Applications of Satisfiability Testing, SAT 2019 - Lisbon, Portugal Duration: 9 Jul 2019 → 12 Jul 2019

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11628 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	22nd International Conference on Theory and Applications of Satisfiability Testing, SAT 2019
Country/Territory	Portugal
City	Lisbon
Period	9/07/19 → 12/07/19

Bibliographical note

Publisher Copyright:
© 2019, Springer Nature Switzerland AG.

Funding

This work was supported in part by DARPA (N66001-18-C-4012 and FA8650-18-2-7861, NSF (1814369), and the Stanford Center for Blockchain Research.

Funders	Funder number
Stanford Center for Blockchain Research
National Science Foundation
Directorate for Computer and Information Science and Engineering	1814369
Defense Advanced Research Projects Agency	FA8650-18-2-7861, N66001-18-C-4012
National Sleep Foundation

Access to Document

10.1007/978-3-030-24258-9_21

Cite this

Ozdemir, A., Niemetz, A., Preiner, M., Zohar, Y., & Barrett, C. (2019). DRAT-based Bit-Vector Proofs in CVC4. In M. Janota, & I. Lynce (Eds.), Theory and Applications of Satisfiability Testing – SAT 2019 - 22nd International Conference, SAT 2019, Proceedings (pp. 298-305). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11628 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-24258-9_21

Ozdemir, Alex ; Niemetz, Aina ; Preiner, Mathias et al. / DRAT-based Bit-Vector Proofs in CVC4. Theory and Applications of Satisfiability Testing – SAT 2019 - 22nd International Conference, SAT 2019, Proceedings. editor / Mikoláš Janota ; Inês Lynce. Springer Verlag, 2019. pp. 298-305 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{177cdd404499433fa5b3d9f9d493006e,

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 = "גרמניה",

}

Ozdemir, A, Niemetz, A, Preiner, M, Zohar, Y & Barrett, C 2019, DRAT-based Bit-Vector Proofs in CVC4. in M Janota & I Lynce (eds), Theory and Applications of Satisfiability Testing – SAT 2019 - 22nd International Conference, SAT 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11628 LNCS, Springer Verlag, pp. 298-305, 22nd International Conference on Theory and Applications of Satisfiability Testing, SAT 2019, Lisbon, Portugal, 9/07/19. https://doi.org/10.1007/978-3-030-24258-9_21

DRAT-based Bit-Vector Proofs in CVC4. / Ozdemir, Alex; Niemetz, Aina; Preiner, Mathias et al.
Theory and Applications of Satisfiability Testing – SAT 2019 - 22nd International Conference, SAT 2019, Proceedings. ed. / Mikoláš Janota; Inês Lynce. Springer Verlag, 2019. p. 298-305 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11628 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - DRAT-based Bit-Vector Proofs in CVC4

AU - Ozdemir, Alex

AU - Niemetz, Aina

AU - Preiner, Mathias

AU - Zohar, Yoni

AU - Barrett, Clark

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85069181352&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-24258-9_21

DO - 10.1007/978-3-030-24258-9_21

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85069181352

SN - 9783030242572

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 298

EP - 305

BT - Theory and Applications of Satisfiability Testing – SAT 2019 - 22nd International Conference, SAT 2019, Proceedings

A2 - Janota, Mikoláš

A2 - Lynce, Inês

PB - Springer Verlag

T2 - 22nd International Conference on Theory and Applications of Satisfiability Testing, SAT 2019

Y2 - 9 July 2019 through 12 July 2019

ER -

Ozdemir A, Niemetz A, Preiner M, Zohar Y, Barrett C. DRAT-based Bit-Vector Proofs in CVC4. In Janota M, Lynce I, editors, Theory and Applications of Satisfiability Testing – SAT 2019 - 22nd International Conference, SAT 2019, Proceedings. Springer Verlag. 2019. p. 298-305. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-24258-9_21

DRAT-based Bit-Vector Proofs in CVC4

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this