Chapter

Tools and Algorithms for the Construction and Analysis of Systems

Volume 4963 of the series Lecture Notes in Computer Science pp 337-340

Z3: An Efficient SMT Solver

  • Leonardo de MouraAffiliated withMicrosoft Research, One Microsoft Way
  • , Nikolaj BjørnerAffiliated withMicrosoft Research, One Microsoft Way

Abstract

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.