SMT-COMP: Satisfiability Modulo Theories Competition
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.
Unable to display preview. Download preview PDF.
- 3.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)Google Scholar
- 5.Ranise, S., Tinelli, C.: The SMT-LIB standard, version 1.1 (2005), Available from the “Documents” section of, http://combination.cs.uiowa.edu/smtlib
- 7.Zantema, H.: personal communication (2005)Google Scholar