1-2 July 2007, 5th International Workshop on Satisfiability Modulo Theories (SMT '07), Berlin, Germany

Deciding the satisfiability of first-order formulas modulo background theories, known as the Satisfiability Modulo Theories (SMT) problem, has proved to be useful in verification, 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.

The aim of the workshop is to bring together researchers and users of SMT tools and techniques. Continuing with the PDPAR tradition, we especially encourage submission of papers focused on pragmatic aspects.

For more information, see http://www.lsi.upc.edu/~oliveras/smt07