论文信息 - Z3: An Efficient SMT Solver

Z3: An Efficient SMT Solver

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.

Nikolaj Bjørner | Leonardo Mendonça de Moura | L. D. Moura | N. Bjørner | Nikolaj S. Bjørner

[1] Sriram K. Rajamani,et al. The SLAM project: debugging system software via static analysis , 2002, POPL '02.

[2] K. Rustan M. Leino,et al. The Spec# Programming System: An Overview , 2004, CASSIS.

[3] Stephen Gilmore,et al. Mobile Resource Guarantees for Smart Devices , 2004, CASSIS.

[4] K. Rustan M. Leino,et al. BoogiePL: A typed procedural language for checking object-oriented programs , 2005 .

[5] David Detlefs,et al. Simplify: a theorem prover for program checking , 2005, JACM.

[6] Miguel Castro,et al. Vigilante: end-to-end containment of internet worms , 2005, SOSP '05.

[7] Thomas A. Henzinger,et al. SYNERGY: a new algorithm for property checking , 2006, SIGSOFT '06/FSE-14.

[8] Nikolai Tillmann,et al. Unit tests reloaded: parameterized unit testing with symbolic execution , 2006, IEEE Software.

[9] Bruno Dutertre,et al. A Fast Linear-Arithmetic Solver for DPLL(T) , 2006, CAV.

[10] Nikolaj Bjørner,et al. Efficient E-Matching for SMT Solvers , 2007, CADE.

[11] Frank Pfenning,et al. Automated Deduction - CADE-21, 21st International Conference on Automated Deduction, Bremen, Germany, July 17-20, 2007, Proceedings , 2007, CADE.

[12] Relevancy Propagation , 2007 .

[13] Shuvendu K. Lahiri,et al. Back to the future: revisiting precise program verification using SMT solvers , 2008, POPL '08.

[14] Nikolaj Bjørner,et al. Model-based Theory Combination , 2008, SMT@CAV.