Article

Z3: an efficient SMT solver

Authors:

TACAS'08/ETAPS'08: Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems

Pages 337 - 340

Published: 29 March 2008 Publication History

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.

References

[1]

Ball, T., Rajamani, S.K.: The SLAM project: debugging system software via static analysis. SIGPLAN Not. 37(1), 1-3 (2002).

Digital Library

Google Scholar

[2]

Barnett, M., Leino, K.R.M., Schulte, W.: The Spec# programming system: An overview. In: Barthe, G., Burdy, L., Huisman, M., Lanet, J.-L., Muntean, T. (eds.) CASSIS 2004. LNCS, vol. 3362, pp. 49-69. Springer, Heidelberg (2005).

Digital Library

Google Scholar

[3]

Costa, M., Crowcroft, J., Castro, M., Rowstron, A.I.T., Zhou, L., Zhang, L., Barham, P.: Vigilante: end-to-end containment of internet worms. In: Herbert, A., Birman, K.P. (eds.) SOSP, pp. 133-147. ACM Press, New York (2005).

Digital Library

Google Scholar

[4]

Bjørner, N.S., de Moura, L.: Efficient E-Matching for SMT Solvers. In: Pfenning, F. (ed.) CADE2007. LNCS (LNAI), vol. 4603, pp. 183-198. Springer, Heidelberg (2007).

Digital Library

Google Scholar

[5]

de Moura, L., Bjørner, N.: Model-based Theory Combination. In: SMT 2007 (2007).

Google Scholar

[6]

de Moura, L., and Bjørner, N.: Relevancy Propagation. Technical Report MSRTR- 2007-140, Microsoft Research (2007).

Google Scholar

[7]

DeLine, R., Leino, K.R.M.: BoogiePL: A typed procedural language for checking object-oriented programs. Technical Report 2005-70, Microsoft Research (2005).

Google Scholar

[8]

Detlefs, D., Nelson, G., Saxe, J.B.: Simplify: a theorem prover for program checking. J. ACM 52(3), 365-473 (2005).

Digital Library

Google Scholar

[9]

Dutertre, B., de Moura, L.: A Fast Linear-Arithmetic Solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81-94. Springer, Heidelberg (2006).

Digital Library

Google Scholar

[10]

Gulavani, B.S., Henzinger, T.A., Kannan, Y., Nori, A.V., Rajamani, S.K.: Synergy: a new algorithm for property checking. In: Young, M., Devanbu, P.T. (eds.) SIGSOFT FSE, pp. 117-127. ACM, New York (2006).

Digital Library

Google Scholar

[11]

Lahiri, S.K., Qadeer, S.: Back to the Future: Revisiting Precise Program Verification using SMT Solvers. In: POPL 2008 (2008).

Digital Library

Google Scholar

[12]

Ranise, S., Tinelli, C.: The Satisfiability Modulo Theories Library (SMT-LIB) (2006), http://www.SMT-LIB.org

Google Scholar

[13]

Tillmann, N., Schulte, W.: Unit Tests Reloaded: Parameterized Unit Testing with Symbolic Execution. IEEE software 23, 38-47 (2006).

Digital Library

Google Scholar

Cited By

View all

Högberg JFernandez-Reyes KVoinea A(2024)Modeling Erlang Compiler IR as SMT FormulasProceedings of the 23rd ACM SIGPLAN International Workshop on Erlang10.1145/3677995.3678193(45-54)Online publication date: 28-Aug-2024
https://dl.acm.org/doi/10.1145/3677995.3678193
Xu W(2024)NFaaS: Network Function as a Service Framework in Programmable NetworksProceedings of the ACM Turing Award Celebration Conference - China 202410.1145/3674399.3674489(246-248)Online publication date: 5-Jul-2024
https://dl.acm.org/doi/10.1145/3674399.3674489
Yao YCui ZTian LLi MPan FHu Y(2024)Scaver: A Scalable Verification System for Programmable NetworkProceedings of the 2024 SIGCOMM Workshop on Formal Methods Aided Network Operation10.1145/3672199.3673887(14-19)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3672199.3673887
Show More Cited By

Z3: an efficient SMT solver
1. Theory of computation

Recommendations

Navigating the Universe of Z3 Theory Solvers
Formal Methods: Foundations and Applications
Abstract
Modular combination of theory solvers is an integral theme in engineering modern SMT solvers. The CDCL(T) architecture provides an overall setting for how theory solvers may cooperate around a SAT solver based on conflict driven clause learning. ...
Supercharging Plant Configurations Using Z3
Integration of Constraint Programming, Artificial Intelligence, and Operations Research
Abstract
We describe our experiences using Z3 for synthesizing and optimizing next generation plant configurations for a car manufacturing company (The views expressed in this writing are our own. They make no representation on behalf of others). Our ...
Engineering theories with z3
CPP'11: Proceedings of the First international conference on Certified Programs and Proofs

Modern Satisfiability Modulo Theories (SMT) solvers are fundamental to many program analysis, verification, design and testing tools. They are a good fit for the domain of software and hardware engineering because they support many domains that are ...

Comments

Information & Contributors

Information

Published In

TACAS'08/ETAPS'08: Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems

March 2008

518 pages

ISBN:3540787992

Editors:
C. R. Ramakrishnan
Stony Brook University, Department of Computer Science, Stony Brook, NY
,
Jakob Rehof
Universität Dortmund, Fachbereich Informatik, Dortmund, Germany

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 29 March 2008

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1,915
Total Citations
View Citations
10
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Högberg JFernandez-Reyes KVoinea A(2024)Modeling Erlang Compiler IR as SMT FormulasProceedings of the 23rd ACM SIGPLAN International Workshop on Erlang10.1145/3677995.3678193(45-54)Online publication date: 28-Aug-2024
https://dl.acm.org/doi/10.1145/3677995.3678193
Xu W(2024)NFaaS: Network Function as a Service Framework in Programmable NetworksProceedings of the ACM Turing Award Celebration Conference - China 202410.1145/3674399.3674489(246-248)Online publication date: 5-Jul-2024
https://dl.acm.org/doi/10.1145/3674399.3674489
Yao YCui ZTian LLi MPan FHu Y(2024)Scaver: A Scalable Verification System for Programmable NetworkProceedings of the 2024 SIGCOMM Workshop on Formal Methods Aided Network Operation10.1145/3672199.3673887(14-19)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3672199.3673887
Cui ZHou STian LWang YYi XWang YYi PChen H(2024)P4-Ace: Resource-Efficient Optimization and Verification for Programmable SwitchesProceedings of the 2024 SIGCOMM Workshop on Formal Methods Aided Network Operation10.1145/3672199.3673884(8-13)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3672199.3673884
Zheng YYang YChen MQuinn A(2024)Kgent: Kernel Extensions Large Language Model AgentProceedings of the ACM SIGCOMM 2024 Workshop on eBPF and Kernel Extensions10.1145/3672197.3673434(30-36)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3672197.3673434
Wu NLi YYang HChen HDai SHao CYu CXie Y(2024)Survey of Machine Learning for Software-assisted Hardware Design Verification: Past, Present, and ProspectACM Transactions on Design Automation of Electronic Systems10.1145/366130829:4(1-42)Online publication date: 24-Apr-2024
https://dl.acm.org/doi/10.1145/3661308
He WDi PMing MZhang CSu TLi SSui Y(2024)Finding and Understanding Defects in Static Analyzers by Constructing Automated OraclesProceedings of the ACM on Software Engineering10.1145/36607811:FSE(1656-1678)Online publication date: 12-Jul-2024
https://dl.acm.org/doi/10.1145/3660781
Murali ARivera CMadhusudan P(2024)Predictable Verification using Intrinsic DefinitionsProceedings of the ACM on Programming Languages10.1145/36564508:PLDI(1804-1829)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656450
Wang PYang TFu HLi GOng C(2024)Static Posterior Inference of Bayesian Probabilistic Programming via Polynomial SolvingProceedings of the ACM on Programming Languages10.1145/36564328:PLDI(1361-1386)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656432
Hu YGilad AStephens-Martinez KRoy SYang J(2024)Qr-Hint: Actionable Hints Towards Correcting Wrong SQL QueriesProceedings of the ACM on Management of Data10.1145/36549952:3(1-27)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3654995
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Navigating the Universe of Z3 Theory Solvers

Supercharging Plant Configurations Using Z3

Engineering theories with z3

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations