Conrad Rau, David Sabel and Manfred Schmidt-Schauss
  Encoding Induction in Correctness Proofs of Program Transformations as a Termination Problem

Christina Borralleras, Miquel Bofill, Enric Rodríguez Carbonell and Albert Rubio
  The recursive path and polynomial ordering

Bernhard Gramlich and Klaus Györgyfalvay        
  On Modularity of Termination Properties of Rewriting under Strategies
Christian Sternagel and René Thiemann 
  A Relative Dependency Pair Framework

Michael Codish, Igor Gonopolskiy, Amir Ben-Amram, Carsten Fuhs and Jürgen Giesl
  Termination Analysis via Monotonicity Constraints over the Integers and SAT Solving
Marc Brockschmidt, Thomas Ströder, Carsten Otto and Jürgen Giesl
  Proving Non-Termination for Java Bytecode

Harald Zankl, Sarah Winkler and Aart Middeldorp
  Automating Ordinal Interpretations
Fabian Emmes, Tim Enger and Jürgen Giesl 
  Detecting Non-Looping Non-Termination
Marc Brockschmidt, Richard Musiol, Carsten Otto and Jürgen Giesl
  Proving Termination of Java Bytecode with Cyclic Data

René Thiemann 
  A Report on the Certification Problem Format
Beniamino Accattoli and Ugo Dal Lago
  On the Invariance of the Unitary Cost Model for Head Reduction
Bertram Felgenhauer
  Binomial Interpretations

Patrick Baillot and Ugo Dal Lago
  Higher-Order Interpretations and Program Complexity
Alexander Bau, Tobias Kalbitz, Maria Voigtländer and Johannes Waldmann  
  Recent Developments in the Matchbox Termination Prover
Martin Avanzini, Naohi Eguchi and Georg Moser
  On a Correspondence between Predicative Recursion and Register Machines

Thomas Ströder, Fabian Emmes, Peter Schneider-Kamp and Jürgen Giesl     
  Automated Runtime Complexity Analysis for Prolog by Term Rewriting
Georg Moser and Michael Schaper
  Termination Graphs Revisited
Friedrich Neurauter and Aart Middeldorp  
  Interpretations for Polynomial Derivational Complexity