[TYPES] CFP: INFINITY 2005

Scott Smolka sas at cs.sunysb.edu
Sun Jan 16 16:13:47 EST 2005


*******************************************************************

***                       INFINITY 2005                         ***

***        7th International Workshop on Verification of        ***

***                  Infinite-State Systems                     ***

***           (A Satellite Workshop of CONCUR 2005)             ***

***              http://www.brics.dk/infinity05/                ***

***      August 27, 2005, San Francisco, California, USA        ***

***                     FIRST CALL FOR PAPERS                   ***

*******************************************************************

The aim:

     The aim is, to provide a forum for researchers interested in
     the development of mathematical techniques for the analysis
     and verification of systems with infinitely many states.

Topics:

     Topics of interest include (but are not limited to):
     techniques for modeling and analysis of infinite-state systems;
     equivalence-checking and model-checking with infinite-state systems;
     parameterized systems; probabilistic and timed systems; calculi for
     mobility and security; finite-state abstractions of infinite-state
     systems; data structures for infinite state spaces.

Paper submission:

     Authors are invited to submit an extended abstract presenting recent
     (or ongoing) work in the areas relevant for the scope of INFINITY.
     Contributions should not exceed 10 pages and ENTCS format of the
     submission is highly recommended. The submissions will be evaluated
     by the programme committee and accepted papers will be published in
     the workshop proceedings. By submitting you agree that at least one
     (co-)author will register and present the paper at the workshop.

     Papers should be submitted electronically (in pdf format), by email
     to both conference co-chairs (srba at cs.aau.dk, sas at cs.sunysb.edu).
     Please, include a title, abstract, all authors and contact details
     of a single corresponding author (address, email and phone number)
     into the email as a plain text. You should receive a confirmation
     of your submission within two days. If not, then we did not receive
     your submission so resubmit, please.

Proceedings:

     Pre-proceedings of INFINITY 2005 will be available at the workshop,
     published as a BRICS Research Report of Aarhus University. Authors
     will be invited to place full papers (of at least ten pages) in
     a volume of Electronic Notes in Theoretical Computer Science series
     dedicated to workshops affiliated to CONCUR'05.

Program committee:

     Samik Basu,  Iowa State University (USA)
     Petr Jancar, Technical University of Ostrava (Czech Republic)
     Richard Mayr, North Carolina State University (USA)
     Ken McMillan, Berkeley (USA)
     Faron Moller, University of Wales Swansea (UK)
     Philippe Schnoebelen, LSV, ENS de Cachan (France)
     Scott Smolka (co-chair), Stony Brook University (USA)
     Jiri Srba (co-chair), BRICS, Aalborg University (Denmark)
     Igor Walukiewicz, Bordeaux University (France)
     Willem Visser, NASA Ames (USA)

Invited talk:

     The invited talk will be delivered by Antonin Kucera
     (Brno, Czech Republic).

Important dates:

     Submission deadline: May 20th, 2005 (Friday)
     Notification: June 17th, 2005
     Final version for pre-proceedings: June 25th, 2005
     Final version for ENTCS: September 29th, 2005

Further information:

     srba at cs.aau.dk, sas at cs.sunysb.edu
     http://www.brics.dk/infinity05/

Registration:

    The INFINITY 2005 workshop is a satellite workshop of the
    16th International Conference on Concurrency Theory (CONCUR 2005)
    (see http://www.soe.ucsc.edu/concur05/). The workshop will be
    held at the same location as CONCUR 2005, on the day immediately
    after the conference (August 27). Registration will be handled by
    the CONCUR 2005 organizing committee.


More information about the Types-list mailing list