SMT 2009
7th International Workshop on Satisfiability Modulo Theories

Determining 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.

The aim of this workshop is to bring together researchers working on SMT and users of SMT 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

There are three categories of submissions:

• Extended abstracts contain preliminary reports of work in progress. They may range in length from very short (a couple of pages) to the full 10 pages and 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 post-workshop proceedings (see below).
• 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 should be submitted using the automated submission system

Papers in all categories will be peer-reviewed. Submitted papers (PDF or PostScript) should not exceed 10 pages and should be written in LaTeX with the following settings: 11pt, one column, a4paper and standard margins. The paper may include, in addition, an appendix containing technical details, which reviewers may read or not, at their discretion.

Call for papers: pdf.

Submission is now closed.

Only informal proceedings will be distributed at the workshop. Papers in the `Original papers' category will also be published -- unless the authors prefer otherwise -- in a post-workshop proceedings in a special volume of the ACM International Conference Proceedings Series (ISBN 978-1-60558-484-3).

• Submission deadline: May 22nd, 2009
• Notification of acceptance/rejection: June 22nd, 2009
• Final version due: July 2nd, 2009
• Workshop: Aug. 2-3, 2009

• Domagoj Babic
  
• Clark Barrett
  New York University
• Leonardo de Moura
  Microsoft Research
• Armin Biere
  Johannes Kepler University
• Aaron Bradley
  CU colorado
• Sylvain Conchon
  Paris-Sud University
• Bruno Dutertre (co-chair)
  SRI International
• Daniel Kroening
  Oxford Univ.
• Sava Krstic
  Intel Corporation
• Robert Nieuwenhuis
  Techn. Univ. of Catalonia
• Silvio Ranise
  LORIA, Nancy
• Roberto Sebastiani
  Universita di Trento
• Ofer Strichman (co-chair)
  Technion
• Cesare Tinelli
  University of Iowa

• SMT 2008
• SMT 2007
• PDPAR 2006
• PDPAR 2005
• PDPAR 2004
• PDPAR 2003