[SMT-LIB] SMT2011: Final call for papers

[Shuvendu Lahiri]

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

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

                            SMT Workshop 2011
     9th International Workshop on Satisfiability Modulo Theories
         Affiliated with CAV'11 Snowbird, Utah, USA, 14-15 July 2011
           http://uclid.eecs.berkeley.edu/smt11/

                         ---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:

* New decision procedures and new 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, 2011
* Notification of acceptance/rejection -  May 20, 2011
* Final version due                    -  June 10, 2011
* Workshop:                            -  July 14-15, 2011

Paper submission and Proceedings
--------------------------------

Three categories of submissions are invited:

* 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. Given the informal style of the workshop, papers describing
  work in progress, with sufficient detail to assess the contribution,
  are also welcome.

* Extended abstracts: contain preliminary reports of work in progress.
  These will be judged based on the expected level of interest for the
  SMT community.  They will be included in the informal proceedings.

* 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 written in LaTeX,
11pt, one column, letter-size paper, standard margins. Technical details
may be included in an appendix to be read at the reviewers' discretion.

The proceedings of the workshop will be published in the International
Conference Proceedings Series in the ACM Digital Libary.

Invited speakers
----------------
Bud Mishra (NYU)
Viktor Kuncak (EPFL)


Workshop Chairs
---------------
* Shuvendu K. Lahiri   (Microsoft Research)
* Sanjit A. Seshia     (University of California, Berkeley)

Program Committee
-----------------
* Clark Barrett        (NYU)
* Maria Paola Bonacina (Univ. of Verona)
* Alessandro Cimatti   (FBK Trento)
* Scott Cotton         (Univ. College Dublin)
* Bruno Dutertre       (SRI International)
* Martin Fränzle       (Carl von Ossietzky Universität Oldenburg)
* Vijay Ganesh         (MIT)
* Amit Goel            (Intel)
* Franjo Ivancic       (NEC Labs)
* Daniel Kroening      (Oxford)
* Andreas Kuehlmann    (Coverity)
* Shuvendu K. Lahiri   (Microsoft Research)
* Leonardo de Moura    (Microsoft Research)
* Sanjit A. Seshia     (University of California, Berkeley)
* Ofer Strichman       (Technion)
* Cesare Tinelli       (Iowa)

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