Microsoft Research Z3 is a high-performance theorem prover that includes many efficient custom solvers for data-type theories that are common in program testing, verification, synthesis, and analysis.
Z3 integrates efficient constraint solving technologies for propositional satisfiability, free functions, linear arithmetic over the reals and integers, bit-vectors, algebraic data-types, and applicative arrays. It can be used for checking satisfiability of logical formulas with quantifiers, as well by leveraging quantifier instantiation procedures, saturation, and quantifier-elimination procedures for reals, integers, and algebraic datatypes.
Besides supporting a rich base of theories, Z3 is also highly customizable with an extensive API and support for custom theories.
• High-performance theorem prover • Checks satisfiability of logical formulas with quantifiers • Includes support for custom theories • Integrates efficient constraint solving technologies • Highly customizable with an extensive API