SMT 2018 - Call For Papers

 16th International Workshop on Satisfiability Modulo Theories

               July 12 - 13, 2018, Oxford, UK

         Affiliated with IJCAR 2018, part of FLoC 2018

                http://smt-workshop.cs.uiowa.edu/2018/

***************************************************************************

Background

=========

Determining the satisfiability of first-order formulas modulo background theories, known as the Satisfiability Modulo Theories (SMT) problem, has proven 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.

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

* Applications and case studies

* Benchmarks and evaluation methodologies

* Theoretical results

Papers on pragmatic aspects of implementing and using SMT tools, as well as novel applications of SMT, in particular in the areas of machine learning and statistical reasoning, are especially encouraged.

Important dates

============

* Abstract submission deadline: April 8, 2018

* Paper submission deadline: April 15, 2018

* Notification of acceptance: May 15, 2018

* Camera ready versions due: June 15, 2018

* Workshop: July 12-13, 2018

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. (The 10 pages do not include the references.)

To submit a paper, go to the EasyChair SMT page <http://www.easychair.org/conferences/?conf=smt2018> and follow the instructions there.

Program Committee

================

* Erika Ábrahám (RWTH Aachen)

* Aws Albarghouthi (University of Wisconsin-Madison)

* Leonardo Alt (IBM)

* Maria Paola Bonacina (Università degli Studi di Verona)

* Bruno Dutertre (SRI International)

* Liana Hadarean (Synopsys)

* Guy Katz (Stanford University)

* Zachary Kincaid (Princeton University)

* Tim King (Google)

* Ruben Martins (Carnegie Mellon University)

* David Monniaux (VERIMAG)

* Alexander Nadel (Intel)

* Aina Niemetz (Stanford University)

* Marie Pelleau (Université Nice Sophia Antipolis)

* Andrew Reynolds (University of Iowa)

* Philipp Rümmer (Uppsala University)

* Thomas Sturm (CNRS)

* Margus Veanes (Microsoft Research)

Program Chairs

=============

Rayna Dimitrova (University of Leicester)

Vijay D'Silva (Google Inc.)