[clean-list] 2nd CFP: 3rd International Verification Workshop,
VERIFY'06
event at in.tu-clausthal.de
event at in.tu-clausthal.de
Mon Apr 24 17:29:29 MEST 2006
------------------------------------------------------------------------
Event at CIG: To unsubscribe, read the info at the bottom of this message.
------------------------------------------------------------------------
[Apologies if you receive multiple copies]
CALL FOR PAPERS
3rd International Verification Workshop (VERIFY'06)
What are the verification problems? What are the deduction techniques?
in connection with IJCAR'06 at FLoC'06
August 15-16, 2006, Seattle, USA
[http://www.ags.uni-sb.de/~omega/workshops/Verify06/]
********************* Keynote speakers ******************************
** John Rushby (SRI International) **
** Christoph Walther (TU Darmstadt) **
**********************************************************************
The formal verification of critical information systems has a long
tradition as one of the main areas of application for automated
theorem proving. Nevertheless, the area is of still growing
importance as the number of computers affecting everyday life and the
complexity of these systems are both increasing. The purpose of the
VERIFY workshop series is to discuss problems arising during the
formal modeling and verification of information systems and to
investigate suitable solutions. Possible perspectives include those
of automated theorem proving, tool support, system engineering, and
applications.
The VERIFY workshops aim at bringing together people who are
interested in the development of safety and security critical systems,
in formal methods, in the development of automated theorem proving
techniques, and in the development of tool support. Practical
experiences gained in realistic verifications are of interest to the
automated theorem proving community and new theorem proving techniques
should be transferred into practice. The overall objective of the
VERIFY workshops is to identify open problems and to discuss possible
solutions under the theme
What are the verification problems? What are the deduction techniques?
In 2006, VERIFY will specifically consider issues regarding the
application of "tool support for formal modeling, verification and
stepwise system development" without excluding submissions regarding
other topics in the focus of the workshop. Therefore, submissions in
this area are especially encouraged.
Topics include (but are not limited to)
+ ATP techniques in verification + Information flow control
+ Case studies + Refinement & decomposition
(specification & verification)
+ Combination of verification systems + Reliability of mobile computing
+ Integration of ATPs and CASE-tools + Reuse of specifications & proofs
+ Compositional & modular reasoning + Management of change
+ Experience reports on using + Safety-critical systems
formal methods
+ Gaps between problems & techniques + Security models
+ Formal methods for fault tolerance + Tool support for formal methods
Submissions are encouraged in one of the following two categories:
A. Regular papers: Submissions in this category should describe
previously unpublished work (completed or in progress), including
descriptions of research, tools, and applications. Papers must
be formated following the Springer LNCS guidelines and be 6-15
pages long.
B. Discussion papers: Submissions in this category are intended to
initiate discussions and should address controversial issues, and
may include provocative statements. Papers must be formated
following the Springer LNCS guidelines and be 3-15 pages long.
Submission of papers is via EasyChair at www.easychair.org/VERIFY-06/.
Upon submission, the category (either A or B) must be indicated. The
informal workshop proceedings will be distributed at the workshop.
Final versions of accepted papers have to be prepared with LaTeX.
Following up the workshop there will be a call for submissions to a
special issue of the Journal of Automated Reasoning dedicated to the
topics of VERIFY'06. Authors of accepted regular papers are
especially encouraged to submit to this special issue.
Program & WS Co-Chairs
S. Autexier (DFKI & U. Saarbrücken)
H. Mantel (RWTH Aachen)
Program Committee
J.-R. Abrial (ETH Zürich)
B. Dutertre (SRI International)
D. Gollmann (TU Hamburg-Harburg)
R. Hähnle (Chalmers U.)
D. Hutter (DFKI)
A. Ireland (Heriot-Watt U.)
D. Kapur (U. New Mexico, Albuquerque)
J.-P. Katoen (RWTH Aachen)
C. Kreitz (U. Potsdam)
S. Merz (INRIA Lorraine)
J. Richardson (NASA Ames)
S. Rossi (U. Venezia)
B. Sprick (U. Dortmund)
L. Viganò (ETH Zürich)
Important dates:
Submission deadline: May 14, 2006
Notification of acceptance: June 19, 2006
Workshop e-mail: verification-ws at ags.uni-sb.de
--
Serge Autexier Tel: +49-681-302-2133
DFKI GmbH & Fax: +49-681-302-5076
Informatics, Saarland University Email: autexier at dfki.de
66123 Saarbruecken WWW: www.dfki.de/~serge/
------------------------------------------------------------------------
This e-mail was delivered to you by event at in.tu-clausthal.de, what is a
moderated list run by Computational Intelligence Group of Clausthal
University of Technology, Germany. All event announcements sent through
this list are also listed in our conference planner at
http://cig.in.tu-clausthal.de/index.php?id=planner.
In the case of any requests, questions, or comments, do not hesitate and
contact event-owner at in.tu-clausthal.de ASAP.
If you want to unsubscribe from this list, please visit
http://www2.in.tu-clausthal.de/mailman/listinfo/event, or send an e-mail
with a subject unsubscribe to event-request at in.tu-clausthal.de.
If you experience problems with your unsubscription, do not hesitate
and contact the list administrator at event-owner at in.tu-clausthal.de.
******************************************************
* CIG does not take any responsibility for validity *
* of content of messages sent through this list. *
******************************************************
Computational Intelligence Group
Department of Computer Science
Clausthal University of Technology
Germany
http://cig.in.tu-clausthal.de/
More information about the clean-list
mailing list