Many domains are now written in WhyML, proved with Why3 and extracted to OCaml (the proved library): the domain of the reals (unions of intervals and congruences), the bit-vector domain (BDD), known bits, floating-point numbers with the rounding of Flocq, the numbers, the ring normal form.
Also new:
- DSeq, a common theory for arrays and sequences (with OCamlPro)
- Integer bitwise operators and non-linear bit-vector identities
- Floating-point rules ported from COLIBRI
- Rewrite rules for quantified equalities (
:rewrite-rule) - About 870 more goals proved than 0.6 on our benchmarks of program verification