Call for Papers


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, usually leveraging Boolean satisfiability (SAT) solvers. These ingredients together make SMT techniques well-suited for use in larger automated reasoning and verification efforts.

Aims 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
  • Benchmarks and evaluation methodologies
  • Applications and case studies
  • Theoretical results

Papers on pragmatic aspects of implementing and using SMT tools, as well as novel applications of SMT, are especially encouraged.

Important dates

  • Submission deadline: April 15, 2016 May 1, 2016 (Extended)
  • Notification: May 20, 2016
  • Camera ready versions due: May 27, 2016
  • Workshop: July 1-2, 2016

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. Papers should not exceed 10 pages and 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.

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

Encouraging Student Participation through the Morgan Deters Travel Award

The Morgan Deters Travel Award was created to honor the memory of Morgan Deters, for his contributions to the theory and practice of SMT. The award is intended to enable selected students to attend the SMT workshop by partially covering their workshop-related expenses. While preference will be given to students who will play an active role in the workshop, students who do not expect to give presentations, including students who have just begun their research, or are considering the field, are encouraged to apply.

Application for the travel award

The application includes a short recommendation letter written by the student's supervisor. Applications should be submitted by June 5.

Donations to the travel award fund are welcome at the following website.

Program Committee

Invited Speakers

Bruno Dutertre, SRI International

Bruno Dutertre is a Staff Scientist at SRI International, Menlo Park. CA. His research interests include formal methods and their application to the verification of high-integrity systems. At SRI, he maintains and develops formal methods tools, such as, model checkers and SMT solvers. He is the main developer and maintainer of the Yices 2 SMT Solver.

Other speakers will be announced soon.