| Invited Talk (chair: Aart Middeldorp) |
| 9:00 – 10:00 |
Diagram Rewriting: Examples and Theory |
| Yves Lafont |
| Session 1 (chair: Bernhard Gramlich) |
| 10:30 – 11:00 |
New Developments in Environment Machines |
| Maribel Fernandez and Nikolaos Siafakas |
| 11:00 – 11:30 |
Strategy-Based Rewrite Semantics for Membrane Systems Preserves Maximal Concurrency of Rewrite Actions |
| Dorel Lucanu |
| 11:30 – 12:00 |
Recognizing Strategies |
| Bastiaan Heeren and Johan Jeuring |
| Session 2 (chair: Rene Thiemann) |
| 13:30 – 14:00 |
Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures |
| Stephan Falke and Deepak Kapur |
| 14:00 – 14:30 |
Completion as Post-Process in Program Inversion of Injective Functions |
| Naoki Nishida and Masahiko Sakai |
| 14:30 – 15:00 |
A Transformational Approach to Prove Outermost Termination Automatically |
| Matthias Raffelsieper and Hans Zantema |
| Session 3 (chair: Georg Moser) |
| 15:30 – 16:00 |
Computing with Diagrams in Classical Logic |
| Pierre Lescanne and Dragisa Zunic |
| 16:00 – 16:30 |
Closure of Tree Automata Languages under Innermost Rewriting |
| Adrià Gascón, Guillem Godoy and Florent Jacquemard |