[SMT-LIB] CFP: JSAT S.I. on Satisfiability Modulo Theories

[Roberto Sebastiani]

  [We apologize if you receive multiple copies of this announcement]

===================  Preliminary Call for Papers ====================

 Journal on Satisfiability, Boolean Modeling and Computation (JSAT)
        Special Issue on Satisfiability Modulo Theories (SMT) 

                  http://dit.unitn.it/~rseba/jsat_smt06/

   Deadline for paper submission (provisional): November 25th, 2006

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

GENERAL INFORMATION

Satisfiability Modulo Theories (SMT) is the problem of deciding the
satisfiability of first-order formulae with respect to some
decidable background theory (e.g., linear arithmetic, the theory of 
arrays, the theory of bit-vectors). 
SMT techniques are gaining increasing relevance in many application 
domains, including formal verification of hardware and software, 
compiler optimization, planning and scheduling.
SMT is strongly related to SAT, as most SMT tools are built on top of
or interface with efficient SAT solvers.
(See also the SMT-LIB page http://combination.cs.uiowa.edu/smtlib/.)

TOPICS

Topics of interested include, but are not restricted to:

* Novel general SMT techniques

* Novel SMT techniques for theories of interest

* SMT for combined theories

* Novel implementation techniques for SMT

* Applications of SMT


SUBMISSIONS

This special issue welcomes original high-quality contributions that
have been neither published in nor submitted to any journals or
refereed conferences.

All submissions should be written in terms understandable by general
readers of the journal. All submissions will be refereed according
to JSAT standards, as described at JSAT web page (see below). 

Submissions should be written in LaTeX and formatted according to JSAT's 
author guidelines, and should not exceed 20 pages. 
JSAT LaTeX style file can be obtained at the journal web page (see below).

ABOUT JSAT 

JSAT (http://www.isa.ewi.tudelft.nl/Jsat/) is a peer-reviewed journal 
which is freely distributed electronically and published in print by 
IOS Press. The scope of JSAT is propositional reasoning, modeling and
computation, and related topics. JSAT publishes high-quality original 
research papers and survey papers which evidently contribute to deeper 
insight on a SAT-related topic.

GUEST EDITORS

Byron Cook, Microsoft Research - bycook at microsoft.com

Roberto Sebastiani, DIT, Universita` di Trento - rseba at dit.unitn.it

FURTHER INFORMATION

For further information visit the web page:
http://dit.unitn.it/~rseba/jsat_smt06/
or send an email to one of the guest editors.