Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays

@inproceedings{Brummayer2009BoolectorAE,
  title={Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays},
  author={Robert Brummayer and Armin Biere},
  booktitle={TACAS},
  year={2009}
}
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. 
Highly Influential
This paper has highly influenced 55 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 362 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 222 extracted citations

362 Citations

0204060'09'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 362 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Exploiting Structure for Scalable Software Verification

  • D. Babic
  • PhD thesis,
  • 2008
1 Excerpt

and A

  • C. Barrett, M. Deters, A. Oliveras
  • Stump. SMT-Comp,
  • 2008
1 Excerpt

and C

  • S. Ranis
  • Tinelli. The satisfiability modulo theories…
  • 2008
1 Excerpt

Similar Papers

Loading similar papers…