[Om-announce] SMT 2017 workshop : 2nd CFP, Deadline 1st/8th May

Martin Nyx Brain martin.brain at cs.ox.ac.uk
Wed Apr 26 00:28:33 CEST 2017


*** Apologies for multiple copies, please redistribute ***

--- Call For Papers ---

SMT 2017
15th International Workshop on Satisfiability Modulo Theories
July 22 - 23, 2017, Heidelberg, Germany
Affiliated with CAV 2017

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

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.

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, are especially encouraged.

Important dates
---------------

* Abstract submission deadline: Mon, May 1, 2017
* Paper submission deadline: Mon, May 8, 2017
* Notification: Mon, Jun 5, 2017
* Camera ready versions due: Mon, Jun 12, 2017
* Workshop: July 22-23, 2017

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 page does not include
references.)

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

Program Committee Chairs
-----------------

Liana Hadarean (Synopsys)
Martin Brain (Oxford University)


Program Committee
-----------------

Alberto Griggio (Fondazione Bruno Kessler - FBK)
Aina Niemetz (Johannes Kepler University)
Bruno Dutertre (SRI International)
Pascal Fontaine (Université de Lorraine)
Christoph M. Wintersteiger (Microsoft Research)
Jochen Hoenicke (University of Freiburg)
Guy Katz (Stanford University)
Sylvain Conchon (Laboratoire de Recherche en Informatique - LRI)
Mate Soos (Gotham Digital Science)
Alexander Nadel (Intel)
Jasmin Christian Blanchette (Vrije Universiteit Amsterdam)
Sicun Gao (MIT)
Rayna Dimitrova (Max Planck Institute for Software Systems)
Florian Schanda (Altran)





More information about the Om-announce mailing list