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, synthesis, test generation, compiler optimization, scheduling, and other areas. The success of SMT techniques depends on the development of both domain-specific decision procedures for each background 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 ingredients together make SMT techniques well-suited for use in larger automated reasoning and verification efforts.

Aim and Scope

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

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

Paper submission and Proceedings

Three categories of submissions are invited:

• Extended abstracts : given the informal style of the workshop, we strongly encourage the submission of preliminary reports of work in progress. They may range in length from very short (a couple of pages) to the full 10 pages and they will be judged based on the expected level of interest for the SMT community. They will be included in the informal proceedings.
• Original papers: contain original research (simultaneous submissions are not allowed) and sufficient detail to assess the merits and relevance of the submission. For papers reporting experimental results, authors are strongly encouraged to make their data available.
• Presentation-only papers: describe work recently published or submitted and will not be included in the proceedings. We see this as a way to provide additional access to important developments that SMT Workshop attendees may be unaware of.

Papers in all three categories will be peer-reviewed. Extended abstracts and original papers should not exceed 10 pages. All papers should be in standard-conforming PDF. Technical details may be included in an appendix to be read at the reviewers' discretion. Final versions should be prepared in LaTeX using the easychair.cls class file. (The 10 page limit does not include references.). Presentation-only papers may be submitted as originally published, if published elsewhere, and should not exceed 10 pages otherwise.

To submit a paper, go to the EasyChair SMT page and follow the instructions there.

Invited Speakers

• Mike Whalen, Amazon
• Oded Padon, VMware Research

Program Chairs

• Stéphane Graham-Lengrand - SRI International
• Mathias Preiner - Stanford University

Program Committee

• Leonardo Alt - Ethereum Foundation
• Clark Barrett - Stanford University
• François Bobot - CEA
• Martin Brain - University of Oxford
• Simon Cruanes - Imandra
• Rayna Dimitrova - CISPA Helmholtz Center for Information Security
• Bruno Dutertre - Amazon Web Services
• Katalin Fazekas - TU Wien
• Jochen Hoenicke - Certora
• Antti Hyvärinen - USI
• Ahmed Irfan SRI - International
• Mikolas Janota - Czech Technical University in Prague
• Martin Jonas - Fondazione Bruno Kessler, Italy
• Daniela Kaufmann - TU Wien
• Aina Niemetz - Stanford University
• Andres Noetzli - Stanford University
• Tanja Schindler - University of Liège
• Hans-Jörg Schurr - University of Iowa
• Sophie Tourret - INRIA and MPI for Informatics
• Yoni Zohar - Stanford University

Contact

All questions about submissions should be emailed to the PC chairs.