RTA 2009 Programme

Monday, June 29

Session 1 9:00-10:10

Chair: Jürgen Giesl

9:00-9:10 RTA Welcome
9:10-10:10 Invited talk: Johannes Waldmann. Automatic Termination.

Session 2 10:40-12:10

Chair: Franz Baader

10:40-11:10 René Thiemann and Christian Sternagel. Loops under Strategies.
11:10-11:40 Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp and Stephan Falke. Proving Termination of Integer Term Rewriting.
11:40-12:10 Martin Avanzini and Georg Moser. Dependency Pairs and Polynomial Path Orders.

Session 3 14:10-15:30

Chair: Hitoshi Ohsaki

14:10-14:40 Guillem Godoy and Florent Jacquemard. Unique Normalization for Shallow TRS.
14:40-15:10 Aleksy Schubert. The existential fragment of the one-step parallel rewriting theory.
15:10-15:30 Takahito Aoto, Junichi Yoshida and Yoshihito Toyama. Proving Confluence of Term Rewriting Systems Automatically (system description).

Session 4 (16:00-18:00)

Chair: Santiago Escobar

16:00-16:30 Alwen Tiu and Rajeev Goré. A Proof Theoretic Analysis of Intruder Theories.
16:30-17:00 Helmut Seidl and Kumar Neeraj Verma. Flat and One-Variable Clauses for Single Blind Copying Protocols: the XOR Case.
17:00-17:30 Sergiu Bursuc and Hubert Comon-Lundh. Protocol security and algebraic properties: decision results for a bounded number of sessions.
17:30-18:00 Mathieu Baudet, Véronique Cortier and Stéphanie Delaune. YAPA: A generic tool for computing intruder knowledge.

Tuesday, June 30

Session 5 (9:00-10:00)

Chair: Manfred Schmidt-Schauß

9:00-10:00 Invited talk: Vincent Danos. Rule-based Modelling and Coarse-graining.

Session 6 (10:30-12:00)

Chair: Dan Dougherty

10:30-11:00 Hans Zantema. Well-definedness of Streams by Termination.
11:00-11:30 Stefan Kahrs. Modularity of Convergence in Infinitary Rewriting.
11:30-12:00 Dominique Duval, Rachid Echahed and Frédéric Prost. A Heterogeneous Pushout Approach to Term-Graph Transformation.

Session 7 (14:00-15:30)

Chair: Elaine Pimentel

14:00-14:30 Marc de Falco. An Explicit Framework for Interaction Nets.
14:30-15:00 Daisuke Kimura and Makoto Tatsuta. Dual Calculus with inductive and coinductive types.
15:00-15:30 Jeroen Ketema. Comparing Böhm-Like Trees.

Session 8 (16:00-17:40)

Chair: Takahito Aoto

16:00-16:30 Georg Moser and Andreas Schnabl. The Derivational Complexity Induced by the Dependency Pair Method.
16:30-17:00 Jörg Endrullis, Roel de Vrijer and Johannes Waldmann. Local Termination.
17:00-17:20 Felix Schernhammer and Bernhard Gramlich. VMTL - A Modular Termination Laboratory (system description).
17:20-17:40 Martin Korp, Christian Sternagel, Harald Zankl and Aart Middeldorp. Tyrolean Termination Tool 2 (system description).

Business Meeting

17:45-19:15 RTA Business Meeting

Wednesday, July 1

Session 9 (8:55-10:00)

8:55-9:00 TLCA Welcome
9:00-10:00 RDP joint invited talk: Bob Harper. A Pronominal Approach to Binding and Computation.

Session 10 (10:30-12:00)

Chair: Rachid Echahed

10:30-11:00 Jörg Endrullis and Dimitri Hendriks. From Outermost to Context-Sensitive Rewriting.
11:00-11:30 Francisco Javier Lopéz-Fraguas, Juan Rodríguez-Hortalá and Jaime Sánchez-Hernández. A Fully Abstract Semantics for Constructor Systems.
11:30-12:00 Jakob Grue Simonsen. The Π20-Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity).

Session 11 (14:00-15:20)

Chair: Ralf Treinen

14:00-14:30 Franz Baader and Barbara Morawska. Unification in the Description Logic EL.
14:30-15:00 Adrià Gascón, Guillem Godoy and Manfred Schmidt-Schauß. Unification with Singleton Tree Grammars.
15:00-15:20 Manuel Clavel, Francisco Durán, Steven Eker, Santiago Escobar, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer and Carolyn Talcott. Unification and Narrowing in Maude 2.4 (system description).

This document was translated from LATEX by HEVEA.