Z3

E904158

SMT solver software tool theorem prover

Z3 is a high-performance theorem prover and SMT (Satisfiability Modulo Theories) solver developed by Microsoft Research, widely used in formal verification, program analysis, and automated reasoning.

Try in SPARQL Jump to: Statements Referenced by

Statements (53)

Predicate	Object
instanceOf	SMT solver ⓘ software tool ⓘ theorem prover ⓘ
category	Satisfiability Modulo Theories solver ⓘ automated theorem proving software ⓘ
developer	Microsoft ⓘ Microsoft Research NERFINISHED ⓘ
hasAPI	.NET API NERFINISHED ⓘ C API NERFINISHED ⓘ Java API NERFINISHED ⓘ OCaml API NERFINISHED ⓘ Python API NERFINISHED ⓘ
hostPlatform	Linux NERFINISHED ⓘ Windows NERFINISHED ⓘ macOS NERFINISHED ⓘ
isOpenSource	true ⓘ
license	MIT License ⓘ
programmingLanguage	.NET (bindings) NERFINISHED ⓘ C++ ⓘ Java (bindings) ⓘ OCaml (bindings) NERFINISHED ⓘ Python (bindings) NERFINISHED ⓘ
repository	https://github.com/Z3Prover/z3 ⓘ
supportsFeature	MaxSMT solving ⓘ incremental solving ⓘ model generation ⓘ optimization objectives ⓘ parallel solving (in some configurations) ⓘ proof generation (in some builds) ⓘ quantifier instantiation heuristics ⓘ unsat core extraction ⓘ
supportsInputFormat	SMT-LIB2 NERFINISHED ⓘ native API ⓘ
supportsLogic	SMT-LIB logics ⓘ
supportsTheory	arrays ⓘ bit-vectors ⓘ datatypes ⓘ fixed-size bit-vectors ⓘ floating-point arithmetic ⓘ linear arithmetic ⓘ quantifiers ⓘ sequences ⓘ sets ⓘ uninterpreted functions ⓘ
useCase	automated reasoning ⓘ constraint solving ⓘ formal verification ⓘ hardware verification ⓘ model checking back-end ⓘ program analysis ⓘ software verification ⓘ symbolic execution back-end ⓘ
writtenIn	C++ NERFINISHED ⓘ

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Satisfiability Modulo Theories (SMT) → hasSolver → Z3 ⓘ

subject surface form: Satisfiability Modulo Theories