Skip to main content
Conference ProceedingsOPEN ACCESS

Z3: An efficient SMT Solver

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 4963 LNCS 337-340
DOI: 10.1007/978-3-540-78800-3_24
5.1kCitations
Citations of this article
665Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

De Moura, L., & Bjørner, N. (2008). Z3: An efficient SMT Solver. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4963 LNCS, pp. 337–340). https://doi.org/10.1007/978-3-540-78800-3_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free