Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
RTA 2008 - Call for participation
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2008-06-23 (20:32)
From: Temur Kutsia <kutsia@r...>
Subject: RTA 2008 - Call for participation
[Apologies if you receive multiple copies]

     *                CALL FOR PARTICIPATION                *
     *                                                      *
     *                       RTA 2008                       *
     *         Rewriting Techniques and Applications        *
     *             19th International Conference            *
     *                                                      *
     *             Castle of Hagenberg, Austria             *
     *                                                      *
     *   July 15-17, 2008. Workshops July 14, July 18       *
     *  *
     *                                                      *



   Early registration deadline:           June 30, 2008
   Pre-conference workshops:              July 14, 2008
   Conference:                         July 15-17, 2008
   Post-conference workshops:             July 18, 2008
   IFIP WG 1.6 meeting:                   July 18, 2008

The 19th International Conference on Rewriting Techniques and
Applications (RTA 2008) is organised as part of the RISC Summer
2008, which comprises five conferences, five workshops and the
Training School in Symbolic Computation, and is followed by the
3rd International School on Rewriting in Obergurgl.

RTA is the major forum for the presentation of research on all
aspects of rewriting. Typical areas of interest include
(but are not limited to):

  * Applications: case studies; analysis of cryptographic protocols;
    rule-based (functional and logic) programming; symbolic and
    algebraic computation; theorem proving; system synthesis and
    verification; proof checking; reasoning about programming
    languages and logics; program transformation;

  * Foundations: matching and unification; narrowing; completion
    techniques; strategies; rewriting calculi, constraint solving;
    tree automata; termination; combination;

  * Frameworks: string, term, and graph rewriting; lambda-calculus
    and higher-order rewriting; constrained rewriting/deduction;
    categorical and infinitary rewriting; integration of decision

  * Implementation: implementation techniques; parallel execution;
    rewrite tools; termination checking;

  * Semantics: equational logic; rewriting logic; rewriting models
    of programs.

  * Véronique Cortier (LORIA, CNRS, Nancy).
        Verification Techniques for Cryptographic Protocols.
  * Thomas Hillenbrand (MPI, Saarbrücken).
        Fast Equational Reasoning with Waldmeister.
  * Albert Rubio (UPC, Barcelona).
        Present and Future of Proving Termination of Rewriting.

  *  Erich Kaltofen (North Carolina State University).
        The algebraic Synthesis of Algorithms.

The complete program is available at

  * Andrei Voronkov          University of Manchester

  * Maribel Fernández        King's College London
  * Neil Ghani               University of Strathclyde
  * Jürgen Giesl             RWTH Aachen
  * Guillem Godoy            Universidad Politécnica de Cataluña
  * Jean Goubault-Larrecq    ENS Cachan
  * Tetsuo Ida               University of Tsukuba
  * Claude Kirchner          INRIA
  * Konstantin Korovin       University of Manchester
  * Temur Kutsia             Johannes Kepler University Linz
  * Aart Middeldorp          University of Innsbruck
  * Paliath Narendran        SUNY at Albany
  * Robert Nieuwenhuis       Universidad Politécnica de Cataluña
  * Michaël Rusinowitch      INRIA
  * Aaron Stump              Washington University in St. Louis
  * Jean-Marc Talbot         Université de Provence
  * Yoshihito Toyama         Tohoku University
  * Ralf Treinen             Université Paris Diderot
  * Andrei Voronkov          University of Manchester
  * Hans Zantema             Technische Universiteit Eindhoven

  * Bruno Buchberger         Johannes Kepler University Linz

  * Temur Kutsia             Johannes Kepler University Linz