Abstract
Decision procedures for checking satisfiability of logical formulas are crucial for many verification applications (e.g., [2,6,3]). Of particular recent interest are solvers for Satisfiability Modulo Theories (SMT). SMT solvers decide logical satisfiability (or dually, validity) with respect to a background theory in classical first-order logic with equality. Background theories useful for verification are supported, like equality and uninterpreted functions (EUF), real or integer arithmetic, and theories of bitvectors and arrays. Input formulas are often syntactically restricted; for example, to be quantifier-free or to involve only difference constraints. Some solvers support a combination of theories, or quantifiers.
Chapter PDF
Similar content being viewed by others
References
Le Berre, D., Simon, L.: The essentials of the SAT 2003 competition. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 452–467. Springer, Heidelberg (2004)
Jin, H., Han, H., Somenzi, F.: Efficient Conflict Analysis for Finding All Satisfying Assignments of a Boolean Circuit. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 287–300. Springer, Heidelberg (2005)
Lerner, S., Millstein, T., Chambers, C.: Automatically Proving the Correctness of Compiler Optimizations. In: Gupta, R. (ed.) ACM SIGPLAN Conference on Programming Language Design and Implementation (2003) (received best paper award)
Pelletier, F.J., Sutcliffe, G., Suttner, C.B.: The Development of CASC. AI Communications 15(2-3), 79–90 (2002)
Ranise, S., Tinelli, C.: The SMT-LIB standard, version 1.1 (2005), Available from the “Documents” section of, http://combination.cs.uiowa.edu/smtlib
Velev, M., Bryant, R.: Effective Use of Boolean Satisfiability Procedures in the Formal Verification of Superscalar and VLIW Microprocessors. Journal of Symbolic Computation 35(2), 73–106 (2003)
Zantema, H.: personal communication (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barrett, C., de Moura, L., Stump, A. (2005). SMT-COMP: Satisfiability Modulo Theories Competition. In: Etessami, K., Rajamani, S.K. (eds) Computer Aided Verification. CAV 2005. Lecture Notes in Computer Science, vol 3576. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11513988_4
Download citation
DOI: https://doi.org/10.1007/11513988_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27231-1
Online ISBN: 978-3-540-31686-2
eBook Packages: Computer ScienceComputer Science (R0)