[TYPES] CfP: Graph Transformation for Verification and Concurrency (Concur 2005 satellite)

Arend Rensink rensink at cs.utwente.nl
Tue Feb 8 09:37:29 EST 2005

We invite you to submit a paper to the workshop described in the
enclosed call. The interest for the typing community lies in the fact 
that many graph abstractions considered in the context of verification 
are type graph-based.

Apologies for multiple postings.

-------------- next part --------------
                     Call for Papers

  Graph Transformation for Verification and Concurrency
    21-22 August 2005, San Francisco, California, USA

            Satellite workshop to CONCUR 2005
    23-26 August 2005, San Fransisco, California, USA

Aims and scope

This workshop addresses the application of concurrency theory to
traditional questions of semantics and verification in graph
transformation, and, vice versa, the application of graph transformation
to process calculi and other models of concurrency. Both areas have a
rich tradition and theoretical foundations, and are finding increasing
application in real-world software engineering; yet only the last few
years have seen a convergence of the two fields, at several
points. Areas of common interest are:

  * Visual specification languages and models
  * Behavioural semantics for visual languages
  * Verification and analysis techniques for graph transformation
  * Operational semantics and behavioural congruence in process calculi
    and graph transformation
  * Behaviour-preserving transformation


We solicit contributions to this workshop in the form of
work-in-progress descriptions (up to 5 pages ) or full papers (up to 15
pages) in any of the above (or related) fields. Please use the ENTCS
format and submit your contribution in PDF. The submission works in two

  1. Register your paper with title, authors, abstract, etc. by May 29,
  2. Upload the final version to a link sent to you after the
     registration until June 5, 2005

All submissions will be reviewed by the programme committee. Accepted
contributions will appear in an issue of Elsevier's Electronic Notes in
Theoretical Computer Science, and the authors will be asked to present
their work during the workshop, either as a short presentation (for
work-in-progress) or as a long presentation (for full papers).

Important Dates

  - 29 May 2005
        abstract submission deadline
  - 5 June 2005
        paper submission deadline
  - 3 July 2005
        notification of acceptance or rejection
  - 17 July 2005
        final version

Programme Committee

  * Paolo Baldan, University of Venice
  * Ahmed Bouajjani, University of Paris 7
  * Hartmut Ehrig, Technical University of Berlin
  * Wan Fokkink, Vrije Universiteit Amsterdam
  * Reiko Heckel, University of Leicester (co-chair)
  * Dirk Janssens, University of Antwerp
  * Barbara Koenig, University of Stuttgart (co-chair)
  * Ian Mackie, King's College, London
  * Ugo Montanari, University of Pisa
  * Arend Rensink, University of Twente (chair)
  * Mooly Sagiv, Tel-Aviv University
  * Vladimiro Sassone, University of Sussex
  * Daniel Varro, Budapest University of Technology and Economics
  * Nobuko Yoshida, Imperial College, London


  * Chair: Arend Rensink, University of Twente
       (rensink at cs.utwente.nl)
  * Co-chair: Reiko Heckel, University of Paderborn
       (reiko at mcs.le.ac.uk)
  * Co-chair: Barbara Koenig, University of Stuttgart
       (koenigba at fmi.uni-stuttgart.de)

More information about the Types-list mailing list