[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[PVS] SMT 2008: CFP


                            SMT Workshop'08
     6th International Workshop on Satisfiability Modulo Theories
         Affiliated with CAV'08 Princeton, USA, 7-8 July 2008

                         ---CALL FOR PAPERS--- 



Deciding the satisfiability of first-order formulas modulo background
theories, known as the Satisfiability Modulo Theories (SMT) problem,
has proved to be useful in verification, compiler optimization,
scheduling, and other areas.

The success of SMT techniques depends on the development of both
domain-specific decision procedures for each concrete 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 two ingredients together make SMT techniques well-suited
for use in larger automated reasoning and formal verification efforts.

Aims and Scope

The aim of the workshop is to bring together researchers and users of
SMT tools and techniques.  Continuing the PDPAR tradition, we
especially encourage submission of papers focused on pragmatic
aspects.  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 

Important dates

* Submission deadline                  -  April 23, 2008
* Notification of acceptance/rejection -  May 28, 2008
* Final version due                    -  June 4, 2008
* Workshop:                            -  July 7-8, 2008

Paper submission and Proceedings

* 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
  but not in the ENTCS archive.

* 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, work in
  progress will be welcome.

* 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, a4paper, standard margins. Technical details may be
included in an appendix to be read at the reviewers' discretion.

Invited Speakers

* Jean-Christophe Filliâtre (Laboratoire de Recherche en Informatique - Université Paris Sud)
* Aaron Bradley (CU Colorado)

* Nikolai Tillmann (Microsoft Research)

Workshop Chairs

* Clark Barrett
New York University

* Leonardo de Moura
Microsoft Research

Program Committee

* Nikolaj Bjorner
Microsoft Research

* Alessandro Cimatti
ITC-Irst, Trento

* Bruno Dutertre
SRI International

* Sava Krstic
Intel Corporation

* Robert Nieuwenhuis
Techn. Univ. of Catalonia

* Albert Oliveras
Techn. Univ. of Catalonia

* Silvio Ranise
LORIA, Nancy

* Roberto Sebastiani
Universita di Trento

* Ofer Strichman

* Aaron Stump
Washington University in St. Louis 

* Cesare Tinelli
University of Iowa