Abstract is missing.
- Automatic TerminationJohannes Waldmann. 1-16 [doi]
- Loops under StrategiesRené Thiemann, Christian Sternagel. 17-31 [doi]
- Proving Termination of Integer Term RewritingCarsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke. 32-47 [doi]
- Dependency Pairs and Polynomial Path OrdersMartin Avanzini, Georg Moser. 48-62 [doi]
- Unique Normalization for Shallow TRSGuillem Godoy, Florent Jacquemard. 63-77 [doi]
- The Existential Fragment of the One-Step Parallel Rewriting TheoryAleksy Schubert. 78-92 [doi]
- Proving Confluence of Term Rewriting Systems AutomaticallyTakahito Aoto, Junichi Yoshida, Yoshihito Toyama. 93-102 [doi]
- A Proof Theoretic Analysis of Intruder TheoriesAlwen Tiu, Rajeev Goré. 103-117 [doi]
- Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR CaseHelmut Seidl, Kumar Neeraj Verma. 118-132 [doi]
- Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of SessionsSergiu Bursuc, Hubert Comon-Lundh. 133-147 [doi]
- YAPA: A Generic Tool for Computing Intruder KnowledgeMathieu Baudet, Véronique Cortier, Stéphanie Delaune. 148-163 [doi]
- Well-Definedness of Streams by TerminationHans Zantema. 164-178 [doi]
- Modularity of Convergence in Infinitary RewritingStefan Kahrs. 179-193 [doi]
- A Heterogeneous Pushout Approach to Term-Graph TransformationDominique Duval, Rachid Echahed, Frédéric Prost. 194-208 [doi]
- An Explicit Framework for Interaction NetsMarc de Falco. 209-223 [doi]
- Dual Calculus with Inductive and Coinductive TypesDaisuke Kimura, Makoto Tatsuta. 224-238 [doi]
- Comparing Böhm-Like TreesJeroen Ketema. 239-254 [doi]
- The Derivational Complexity Induced by the Dependency Pair MethodGeorg Moser, Andreas Schnabl. 255-269 [doi]
- Local TerminationJörg Endrullis, Roel C. de Vrijer, Johannes Waldmann. 270-284 [doi]
- VMTL-A Modular Termination LaboratoryFelix Schernhammer, Bernhard Gramlich. 285-294 [doi]
- Tyrolean Termination Tool 2Martin Korp, Christian Sternagel, Harald Zankl, Aart Middeldorp. 295-304 [doi]
- From Outermost to Context-Sensitive RewritingJörg Endrullis, Dimitri Hendriks. 305-319 [doi]
- A Fully Abstract Semantics for Constructor SystemsFrancisco Javier López-Fraguas, Juan Rodríguez-Hortalá, Jaime Sánchez-Hernández. 320-334 [doi]
- The -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity)Jakob Grue Simonsen. 335-349 [doi]
- Unification in the Description Logic Franz Baader, Barbara Morawska. 350-364 [doi]
- Unification with Singleton Tree GrammarsAdria Gascón, Guillem Godoy, Manfred Schmidt-Schauß. 365-379 [doi]
- Unification and Narrowing in Maude 2.4Manuel Clavel, Francisco Durán, Steven Eker, Santiago Escobar, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott. 380-390 [doi]