Autors:

CiteWeb id: 20080000127

CiteWeb score: 2887

DOI: 10.1007/978-3-540-78800-3_24

Satisfiability Modulo Theories (SMT) problem is a decision problem for logical first order formulas with respect to combinations of background theories such as: arithmetic, bit-vectors, arrays, and uninterpreted functions. Z3 is a new and efficient SMT Solver freely available from Microsoft Research. It is used in various software verification and analysis applications.

The publication "Z3: an efficient SMT solver" is placed in the Top 10000 of the best publications in CiteWeb. Also in the category Computer Science it is included to the Top 1000. Additionally, the publicaiton "Z3: an efficient SMT solver" is placed in the Top 1000 among other scientific works published in 2008.
Links to full text of the publication: