[SMT-LIB] 2nd Call for Papers, SMT 2012

[Tinelli, Cesare]

Update: deadlines extensions!


[**** We apologize if you receive multiple copies of this message ******]

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

SMT Workshop 2012

10th International Workshop on Satisfiability Modulo Theories

Affiliated with IJCAR’2012, Manchester, UK

June 30th - July 1st, 2012

Collocated with The Alan Turing Centenary Conference

http://smt2012.loria.fr

--- 2nd CALL FOR PAPERS---

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

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, 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 24th, 2012
* Notification - May 14th, 2012
* Camera ready versions due - June 1st, 2012
* Workshop - June 30th and July 1st, 2012

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 (Postscript or PDF) and should be in
standard-conforming Postscript or 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
http://www.easychair.org/conferences/?conf=smt2012 and follow the
instructions there.

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

* Clark Barrett, New York University
* Nikolaj Bjorner, Microsoft
* Roberto Bruttomesso, University of Milan
* Sylvain Conchon, LRI & University of Paris-Sud
* Bruno Dutertre, SRI
* Pascal Fontaine (University of Lorraine & INRIA), co-chair
* Vijay Ganesh, MIT
* Amit Goel (Intel), co-chair
* Franjo Ivancic, NEC
* Sava Krstic, Intel
* Viktor Kuncak, EPFL
* Shuvendu Lahiri, Microsoft
* Ken McMillan, Microsoft
* Roberto Sebastiani, University of Trento
* Cesare Tinelli, The University of Iowa

--------------------------------------------------------------------------------