We are pleased to announce of Z3 version 1.1.

Z3 is a new high-performance theorem prover for Satisfiability Modulo

Theories (SMT) problems being developed at Microsoft Research. Z3

supports linear real and integer arithmetic, fixed-size bit-vectors,

extensional arrays, uninterpreted functions, and quantifiers. Z3 has

already been integrated in several projects and products at

Microsoft. It can read problems in SMT-LIB, Simplify and a native

low-level format. Z3 can also be invoked programmatically from either

C/C++, OCaml or from .NET.

More information about Z3, including download links are available from:

Kind regards,

Leonardo de Moura and Nikolaj Bjorner.