SMT 2010

Background

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 de­ci­sion 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 auto­mated 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. Relevant topics include but are not limited to:

• New decision procedures and new theories of interest
• Combinations of decision procedures
• Novel implementation techniques
• Benchmarks and evaluation methodologies
• Applications and case studies
• Theoretical results

Papers on pragmatical aspects of implementing and using SMT tools are especially en­cour­aged. Furthermore, we are especially encouraging submissions on the use of SMT in systems verification, and there will be a special issue of FMSD dedicated specifically to the papers on this topic. The chairs will be happy to clarify whether a particular topic is suitable for the work­shop.

Submission and CFP

Invited Speakers

To be announced.

Proceedings

Only informal proceedings will be distributed at the workshop. Papers presented at SMT 2010 will be considered for one of two special issues of the following journals, de­pen­ding on the paper's subject:

Important Dates

Programme Committee

Student Travel Awards

To be announced.

Sponsors

To be announced.