Logic List Mailing Archive

8th International Workshop on Termination (WST 2006), Seattle WA, August 2006


  Eighth International Workshop on Termination (WST 2006)
          Seattle, Washington, 15-16 August 2006

  Part of the Fourth Federated Logic Conference, FLoC 2006


Termination is a fundamental topic in computer science.  Termination
of programs is often a strict requirement, but may be hard to prove.
Classical results state the undecidability of various termination
problems.  So people look for automated methods that prove termination
or non-termination in many practical cases.  Termination proofs are
needed not only for program verification, but also as components of
program transformation systems. The topic is challenging both in
theory (mathematical logic, proof theory) and practice (software
development, formal methods), and many interesting ramifications
are yet to be explored.

The Eighth International Workshop on Termination will delve into all
aspects of termination of processes.  It will continue the sequence
of successful workshops held in St. Andrews (1993), La Bresse (1995),
Ede (1997), Dagstuhl (1999), Utrecht (2001), Valencia (2003), and
Aachen (2004). It will attain the same friendly atmosphere as those
past workshops.   The intent is to bring together, in an informal
setting, researchers interested in all aspects of termination,
whether this interest be practical or theoretical, primary or derived.
The workshop is hoped to provide a ground for cross-fertilisation of
ideas from term rewriting and from the different programming language

Contributions from the constraint, functional, and logic programming
communities, and papers investigating new applications of termination
are particularly welcome.


Termination of programs
Termination of rewriting
Strong and weak normalization of lambda calculi
Challenging termination problems/proofs
Implementations of termination methods
Termination methods for theorem provers
Termination analysis for different language paradigms
Applications to program transformation and compilation
Other applications of termination methods
Comparisons and classification of termination methods
Non-termination and loop detection
Termination in distributed systems
Size-change analysis
Proof methods for liveness and fairness
Well-founded orderings
Well-quasi-order theory
Ordinal notations
Fast/slow growing hierarchies
Derivational complexity


Extended abstracts in the prescribed format should be submitted
electronically through EasyChair's WST 2006 submission site:
http://www.easychair.org/WST2006/.  Authors will be requested to
use a common workshop style file.  Requirements to format will be
made available on the WST 2006 web site.  Papers should be
submitted in PostScript or PDF format.  We expect proceedings to
be made available through the Computing Research Repository, CoRR.


The termination competition will run again in 2006, organised by
Claude Marche and Hans Zantema.  Entries are strongly encouraged.
Details about submissions are available at the competition
website: http://www.lri.fr/~marche/termination-competition/.


Paper submission                             19 May  2006
Notification                                  9 June 2006
Final paper version                          30 June 2006

Expected competition deadlines:

Submission of public problems for database    1 May  2006
Submission of secret problems                31 May  2006
Submission of termination tools              31 May  2006


Thomas Arts         IT Universitet Goteborg, SE
Alfons Geser        HTWK Leipzig, DE (co-chair)
Dieter Hofbauer     Universitat Kassel, DE
Claude Marche       Universite Paris-Sud, FR
Andreas Podelski    Max-Planck-Institut fur Informatik, DE
Henny Sipma         Stanford University, US
Harald Sondergaard  University of Melbourne, AU (co-chair)
Andreas Weiermann   Universiteit Utrecht, NL