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
Bitvector-based theory solver
Boolector is an efficient SMT solver for the quantifier-free theory of bit-vectors in combination with the quantifier-free extensional theory of arrays.
Fast SMT solver for bit-vectors, arrays and uninterpreted functions