Skip to main content
Conference ProceedingsOPEN ACCESS

Boolector: An efficient SMT solver for bit-vectors and arrays

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5505 LNCS 174-177
DOI: 10.1007/978-3-642-00768-2_16
242Citations
Citations of this article
70Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Satisfiability Modulo Theories (SMT) is the problem of deciding satisfiability of a logical formula, expressed in a combination of first-order theories. We present the architecture and selected features of Boolector, which is an efficient SMT solver for the quantifier-free theories of bit-vectors and arrays. It uses term rewriting, bit-blasting to handle bit-vectors, and lemmas on demand for arrays. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Brummayer, R., & Biere, A. (2009). Boolector: An efficient SMT solver for bit-vectors and arrays. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5505 LNCS, pp. 174–177). https://doi.org/10.1007/978-3-642-00768-2_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free