Versions Packages Information History Related Badges Report

Information for boolector

Summaries

  • A Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions
  • An extremely fast SMT solver for bit-vectors and arrays
  • Boolector is an SMT solver for the theory of bit-vectors
  • Boolector is an efficient SMT solver for the quantifier-free theory of bit-vectors in combination with the quantifier-free extensional theory of arrays.
  • Satisfiability Modulo Theories (SMT) solver

Maintainers

Homepages