Proving termination with adornments
Alexander Serebrenik (Katholieke Universiteit Leuven, Belgium)
Danny De Schreye (Katholieke Universiteit Leuven, Belgium)

On Termination of a Tabulation Procedure for Residuated Logic Programming
Manuel Ojeda-Aciego (Universidad de Málaga, Spain)
Carlos V. Damásio (Universidade Nova de Lisboa, Caparica, Portugal)

Quasi-Ordered Gap Embedding
Nachum Dershowitz (Tel Aviv University, Israel)
Iddo Tzameret (Tel Aviv University, Israel)

Mathematical and logical aspects of termination orderings
Andreas Weiermann (Universiteit Utrecht, Netherlands)

A Case Study on Termination
Stephan Frank (Berlin University of Technology, Germany)
Petra Hofstedt (Berlin University of Technology, Germany)
Pierre Mai (PMSF IT Consulting, Ottobeuren, Germany)

Approximating Dependency Graphs without using Tree Automata Techniques
Nao Hirokawa (University of Tsukuba, Japan)
Aart Middeldorp (University of Tsukuba, Japan)

Proving Liveness in Ring Protocols by Termination
Hans Zantema (Eindhoven University of Technology, The Netherlands)
Juergen Giesl (RWTH Aachen, Germany)

One Loop at a Time
Michael Codish (Ben-Gurion University, Beer-Sheva, Israel)
Samir Genaim (Università degli Studi di Verona, Italy)
Maurice Bruynooghe (Katholieke Universiteit Leuven, Belgium)
John Gallagher (Roskilde University, Roskilde, Denmark)
Wim Vanhoof (Katholieke Universiteit Leuven, Belgium)

Termination of Computational Restrictions of Rewriting and Termination of Programs
Salvador Lucas (Universidad Politécnica de Valencia, Spain)

Match-Bounded String Rewriting Systems and Automated Termination Proofs
Alfons Geser (National Institute of Aerospace, Hampton, Virginia, USA)
Dieter Hofbauer (Universität Kassel, Germany)
Johannes Waldmann (Universität Leipzig, Germany)

Termination Dependencies
Nachum Dershowitz (Tel Aviv University, Israel)

On the Complexity of Deciding the Derivation Length in Term Rewriting Systems
Michele Flammini (Universitá di L'Aquila, Italy)
Paola Inverardi (Universitá di L'Aquila, Italy)
Domenico Mango (Universitá di L'Aquila, Italy)
Monica Nesi (Universitá di L'Aquila, Italy)

Proving termination by the Reduction Constraint Framework
Cristina Borralleras (Universitat de Vic, Spain)
Albert Rubio (Universitat Politècnica de Catalunya, Spain)

Explicit substitutions and intersection types
Pierre Lescanne (ENS de Lyon, France)

Dependency, Termination and Overlap Analysis of Higher-order Programs: brief preview
Neil Jones (University of Copenhagen, Denmark)

Hasta-La-Vista: Termination Analyser for Logic Programs
Alexander Serebrenik (Katholieke Universiteit Leuven, Belgium)
Danny De Schreye (Katholieke Universiteit Leuven, Belgium)

TerminWeb: Termination Analyzer for Logic Programs
Samir Genaim (Università degli Studi di Verona, Italy)
Michael Codish (Ben-Gurion University, Beer-Sheva, Israel)

The TALP Tool for Termination Analysis of Logic Programs
Enno Ohlebusch (University of Bielefeld, Bielefeld, Germany)
Claus Claves (Bielefeld, Germany)
Claude Marché (Université Paris-Sud, Orsay, France)

The SCT Analayser: An analysis tool based on size-change termination
A.J. Glenstrup

Tsukuba Termination Tool
Nao Hirokawa (University of Tsukuba, Japan)
Aart Middeldorp (University of Tsukuba, Japan)

AProVE: A System for Proving Termination
Juergen Giesl (RWTH Aachen, Germany)
Rene Thiemann (RWTH Aachen, Germany)
Peter Schneider-Kamp (RWTH Aachen, Germany)
Stephan Falke (RWTH Aachen, Germany)

Proving Termination of Rewriting with CiME
Evelyne Contejean (Université Paris-Sud, Orsay, France)
Claude Marché (Université Paris-Sud, Orsay, France)
Benjamin Monate (École Polytechnique, Palaiseau, France)
Xavier Urbain (Université Paris-Sud, Orsay, France)

CARIBOO : A Multi-Strategy Termination Proof Tool Based on Induction
Olivier Fissore (LORIA-CNRS, Villers-les-Nancy, France)
Isabelle Gnaedig (LORIA-INRIA, Villers-les-Nancy, France)
Helene Kirchner (LORIA-CNRS, Villers-les-Nancy, France)

Termptation
Cristina Borralleras (Universitat de Vic, Spain)
Albert Rubio (Universitat Politècnica de Catalunya, Spain)