Changelog for sbv-3.1

Version 3.1, 2014-07-12

NB: GHC 7.8.1 and 7.8.2 has a serious bug ( that causes SBV to crash under heavy/repeated calls. The bug is addressed in GHC 7.8.3; so upgrading to 7.8.3 is essential for using SBV!

New features/bug-fixes in v3.1:

Version 3.0, 2014-02-16

Version 2.10, 2013-03-22

Version 2.9, 2013-01-02

Version 2.8, 2012-11-29

Version 2.7, 2012-10-21

Versions 2.4, 2.5, and 2.6: Around mid October 2012

Version 2.3, 2012-07-20

Version 2.2, 2012-07-17

Version 2.1, 2012-05-24

Version 2.0, 2012-05-10

This is a major release of SBV, adding support for symbolic algebraic reals: SReal. See for details. In brief, algebraic reals are solutions to univariate polynomials with rational coefficients. The arithmetic on algebraic reals is precise, with no approximation errors. Note that algebraic reals are a proper subset of all reals, in particular transcendental numbers are not representable in this way. (For instance, "sqrt 2" is algebraic, but pi, e are not.) However, algebraic reals is a superset of rationals, so SBV now also supports symbolic rationals as well.

You should use Z3 v4.0 when working with real numbers. While the interface will work with older versions of Z3 (or other SMT solvers in general), it uses Z3's root-obj construct to retrieve and query algebraic reals.

While SReal values have infinite precision, printing such values is not trivial since we might need an infinite number of digits if the result happens to be irrational. The user controls printing precision, by specifying how many digits after the decimal point should be printed. The default number of decimal digits to print is 10. (See the 'printRealPrec' field of SMT-solver configuration.)

The acronym SBV used to stand for Symbolic Bit Vectors. However, SBV has grown beyond bit-vectors, especially with the addition of support for SInteger and SReal types and other code-generation utilities. Therefore, "SMT Based Verification" is now a better fit for the expansion of the acronym SBV.

Other notable changes in the library:

Bugs fixed:


Version 1.4, 2012-05-10

Version 1.3, 2012-02-25

Version 1.2, 2012-02-25


Version 1.1, 2012-02-14


Version 1.0, 2012-02-13




Version 0.9.24, 2011-12-28





Version 0.9.23, 2011-12-05



Version 0.9.22, 2011-11-13

The major change in this release is the support for quantifiers. The SBV library no longer assumes all variables are universals in a proof, (and correspondingly existential in a sat) call. Instead, the user marks free-variables appropriately using forall/exists functions, and the solver translates them accordingly. Note that this is a non-backwards compatible change in sat calls, as the semantics of formulas is essentially changing. While this is unfortunate, it's more uniform and simpler to understand in general.

This release also adds support for the Z3 solver, which is the main SMT-solver used for solving formulas involving quantifiers. More formally, we use the new AUFBV/ABV/UFBV logics when quantifiers are involved. Also, the communication with Z3 is now done via SMT-Lib2 format. Eventually the SMTLib1 connection will be severed.

The other main change is the support for C code generation with uninterpreted functions enabling users to interface with external C functions defined elsewhere. See below for details.

Other changes:


Code generation:


Version 0.9.21, 2011-08-05

Code generation:

Version 0.9.20, 2011-06-05

Regression on 0.9.19; add missing file to cabal

Version 0.9.19, 2011-06-05


Version 0.9.18, 2011-04-07



Version 0.9.17, 2011-03-29



Version 0.9.16, 2011-03-28



Version 0.9.15, 2011-03-24

Bug fixes:


Version 0.9.14, 2011-03-19

Version 0.9.13, 2011-03-16

Bug fixes:


Version 0.9.12, 2011-03-10

New features:

Bug fixes:

Version 0.9.11, 2011-02-16

Version 0.9.10, 2011-02-15

Version 0.9.9, 2011-01-23

Version 0.9.8, 2011-01-22

Version 0.9.7, 2011-01-18

Versions 0.0.0 - 0.9.6, Mid 2010 through early 2011