International Conference on Tools and Algorithms for the Construction and Analysis of Systems

TACAS 2008: Tools and Algorithms for the Construction and Analysis of Systems pp 337-340

Z3: An Efficient SMT Solver

  • Leonardo de Moura
  • Nikolaj Bjørner
Conference paper

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

Volume 4963 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
de Moura L., Bjørner N. (2008) Z3: An Efficient SMT Solver. In: Ramakrishnan C.R., Rehof J. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2008. Lecture Notes in Computer Science, vol 4963. Springer, Berlin, Heidelberg

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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Leonardo de Moura
    • 1
  • Nikolaj Bjørner
    • 1
  1. 1.Microsoft Research, One Microsoft WayRedmondUSA