11th International Workshop on Termination

Edinburgh, July 14-15, 2010

  • You are here: 
  • WST
  • WST 2010


List of Accepted Papers

Nachum Dershowitz. An Abstract Path Ordering
Hans Zantema. Length preserving string rewriting with exponential derivation length
Naoki Nishida, Masahiko Sakai and Tatsuya Hattori. On Disproving Termination of Constrained Term Rewriting Systems
Madalina Erascu and Tudor Jebelean. A Purely Logical Approach to Program Termination
Dean Voets and Daniel De Schreye. Non-termination analysis of Logic Programs using Types
Christian Sternagel and René Thiemann. Certification extends Termination Techniques
Thomas Stroeder, Juergen Giesl and Peter Schneider-Kamp. Termination Analysis of Logic Programs with Cut Using Dependency Triples
Bernhard Gramlich and Felix Schernhammer. Outermost Termination via Contextual Dependency Pairs
Paolo Pilozzi and Danny De Schreye. Scaling termination proofs by a characterisation of cycles in CHR
Martin Avanzini and Naohi Eguchi. A New Path Order for Exponential Time
Harald Zankl and Martin Korp. The Derivational Complexity of the Bits Function and the Derivation Gap Principle
Michael Codish, Carsten Fuhs, Jürgen Giesl and Peter Schneider-Kamp. Lazy abstraction for size-change termination
Georg Moser and Andreas Schnabl. Dependency Graphs, Relative Rule Removal, the Subterm Criterion and Derivational Complexity
Friedrich Neurauter and Aart Middeldorp. Polynomial Termination over N and R does not imply Polynomial Termination over Q
Jean-Pierre Jouannaud and Jian-qi Li. A Computability Path Ordering for Polymorphic Terms
Samir Genaim and Damiano Zanardini. The Acyclicity Inference of COSTA
Cynthia Kop and Femke van Raamsdonk. Higher Order Dependency Pairs with Argument Filterings
Christophe Raffalli and Pierre Hyvernat. Improvements on the "Size Change Termination Principle" in a functional language
Dieter Hofbauer and Johannes Waldmann. Match-Bounds for Relative Termination


The International Workshop on Termination (WST) has been held in St. Andrews (1993), La Bresse (1995), Ede (1997), Dagstuhl (1999), Utrecht (2001), Valencia (2003), Aachen (2004), Seattle (2006), Paris (2007), and Leipzig (2009).

WST traditionally brings together, in an informal setting, researchers interested in all aspects of termination and related topics. This includes all models and fields of computation, like rewriting systems, programming paradigms and languages, transitions systems etc. We welcome reports on basic research as well as on applications and implementations.

The workshop also provides a ground for cross-fertilisation of ideas from term rewriting and from the different programming language communities. We hope to attain the same friendly atmosphere as in past workshops, which enabled fruitful exchanges leading to joint research and subsequent publications.


The 11th Workshop on Termination welcomes contributions on all aspects of termination and termination analysis.

Contributions from the imperative, constraint, functional, and logic programming communities, and papers investigating applications of termination (e.g. in program transformation or theorem proving) are particularly welcome.

For more details, see the call for papers.


Submissions are short papers/extended abstract which should not exceed 5 pages. There will be no formal reviewing. The accepted papers will be made available electronically before the workshop.

Papers should be submitted electronically via the submission page:


Final versions should be created using LaTeX and the style file easychair.cls.

Important Dates

Paper SubmissionApril 18-- updated --
NotificationMay 1-- updated --
Final versions dueMay 17
WorkshopJuly 14-15

Invited Speaker

The keynote will be given by Elvira Albert from the Complutense University of Madrid.

Conference Venue

The workshop will be held as a satellite workshop of RTA and IJCAR at the Federated Logic Confernce (FLoC) which takes place in the School of Informatics at the University of Edinburgh.