[DL] CFP: CADE Workshop on Pragmatics of Decision Procedures in AR

[Cesare Tinelli]

(Apologies for cross postings)

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

                              CADE-19 Workshop 

 

                                 PDPAR'03
           Pragmatics of Decision Procedures in Automated Reasoning

                            Miami, Florida, USA 

                             July 28-29, 2003

                             CALL FOR PAPERS

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

The main goal of this workshop is to bring together researchers 
interested in the pragmatical aspects of decision procedures in
automated reasoning, giving them a forum for presenting and discussing
implementation and evaluation techniques.

Topics of interest include (but are not limited to)

* algorithms and data structures to implement decision procedures
* techniques for the rapid prototyping of decision procedures
* techniques to implement combination or incorporation schemes
* benchmarks to evaluate and/or to compare decision procedures
* methodologies to test decision procedures
* the role of decision procedures in real-world verification efforts
* techniques to promote the re-use and the exchange of code implementing
   decision procedures, combination and integration schemas, ...

Another goal of the workshop is to provide a discussion forum for the
SMT-LIB initiative, a research initiative aimed at establishing a common
standard for the specification of benchmarks and background theories for
satisfiability modulo theories, and at creating a repository of such
benchmarks. (See http://combination.cs.uiowa.edu/smtlib/ for more info.)
The workshop will host panel discussions on the SMT-LIB format.


-----------
Submissions
-----------

Extended abstracts addressing the pragmatical aspects of decision
procedures are solicited. Submitted abstracts should not exceed 8 pages
and should be written in LaTeX with the following settings:
11pt, one column, a4paper and standard margins.

Submissions should be sent by email to pdpar03 at cs.uiowa.edu and contain:
1. title, author(s) (names, correspondence addresses, e-mail addresses);
2. small abstract (< 300 words), in plain text;
3. extended abstract in postscript or PDF format, as an attachment;
4. a single file with the LaTeX2e source of the abstract, including
    any non-standard macro used, again as an attachment.

Submissions will be peer-reviewed. The authors of accepted submissions
are expected to give a 25' presentation at the workshop.
The proceedings of PDPAR'03 will be published as an INRIA technical
report, and will be distributed at the workshop.


------------
Registration
------------

Joint registration with the CADE-19 conference is possible but is not
required. Refer to the CADE-19 web site for registration instructions
and deadlines.


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

  * Silvio Ranise (LORIA & INRIA-Lorraine, France) [Co-chair]
  * Cesare Tinelli (University of Iowa, USA)       [Co-chair]

  * Alessandro Armando (University of Genova, Italy)
  * Clark Barrett (New York University, USA)
  * Sergey Berezin (Stanford University, USA)
  * Alessandro Cimatti (IRST-ITC, Italy)
  * Deepak Kapur (University of New Mexico, USA)
  * Predrag Janicic (University of Belgrade, Yugoslavia)
  * Greg Nelson (HP SRC Classic, USA)
  * Christophe Ringeissen (LORIA & INRIA-Lorraine, France)
  * Harald Ruess (SRI, USA)
  * Roberto Sebastiani (University of Trento, Italy)
  * Ofer Strichman (Carnegie-Mellon University, USA)
  * Aaron Stump (Washington University, USA)
  * Ashish Tiwari (SRI, USA)


---------------
Important Dates
---------------

  April 14, 2003  Submissions of extended abstracts
    May 16, 2003  Notification of acceptance
    May 23, 2003  Early registration
   June 30, 2003  Final versions due
   July 28, 2003  Worskhop
   July 29, 2003  Worskhop


----------------
More Information
----------------

See http://www.loria.fr/~ranise/pdpar03/ for PDPAR'03,
and http://www.cade-19.info/ for CADE-19.