Accepted Papers

Matt Kaufmann, Panagiotis Manolios, J Strother Moore, and Daron Vroon
Integrating CCG Analysis into ACL2

Frederic Blanqui, Adam Koprowski, Solange Coupet-Grimal, William Delobel, and Sebastien Hinderer
CoLoR, a Coq library on Rewriting and termination

Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, Rene Thiemann, and Juergen Giesl
Automating Dependency Pairs Using SAT Solvers

Frederic Blanqui
Higher-order dependency pairs

Peter Schneider-Kamp, Juergen Giesl, Alexander Serebrenik, and Rene Thiemann
Termination Analysis for Logic Programs by Term Rewriting Revisited

Hans Zantema
Termination of Extended String Rewriting

Johannes Waldmann
Free SCC Analysis via Constant Interpretations

Andreas Weiermann
Phase transition phenomena in the context of termination problems

Naoki Nishida, Koichi Miura
Dependency Graph Method for Proving Termination of Narrowing

Joerg Endrullis, Dieter Hofbauer, and Johannes Waldmann
Decomposing Terminating Rewrite Relations

Harald Zankl, Aart Middeldorp
KBO as a Satisfaction Problem

Yi Wang, Masahiko Sakai
On Non-looping Term Rewriting

Manh Thang Nguyen, Maurice Bruynooghe, Danny De Schreye, and Michael Leuschel
Program Specialisation as a Pre-processing Step for Termination Analysis

Harald Zankl, Nao Hirokawa, and Aart Middeldorp
Constraints for Argument Filterings

Wojciech Moczydlowski
Normalization of intuitionistic set theories