Determining the satisfiability of first-order formulas modulo background theories, known as the Satisfiability Modulo Theories (SMT) problem, has proved to be an enabling technology for verification, test-vector generation, compiler optimization, scheduling, and other areas.

The success of SMT techniques depends on the development of both domain-specific decision procedures for each concrete theory (e.g., linear arithmetic, the theory of arrays, or the theory of bit-vectors) and combination methods that allow one to obtain more versatile SMT tools. These two ingredients together make SMT techniques well-suited for use in larger automated reasoning and formal verification efforts.

Aims and Scope

The aim of this workshop is to bring together researchers working on SMT and users of SMT techniques and tools. Relevant topics include but are not limited to:

Papers on pragmatical aspects of implementing and using SMT tools are especially encouraged.

Next edition: SMT 2017, July 22–23, 2017, Heidelberg, Germany