Call for Papers
Ninth International Workshop on Termination (WST 2007)
Paris, France, June 29, 2007
Affiliated with RDP 2007
Termination is a fundamental topic in computer science. Though termination of processes is often a
strict requirement, it may be hard to establish. Classical results state the undecidability of
various termination problems, so research focuses on automated methods that prove termination
or non-termination in practical cases. 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 9th International Workshop on Termination will delve into all aspects of termination. It will
continue the sequence of successful workshops held in St. Andrews (1993), La Bresse (1995), Ede (1997),
Dagstuhl (1999), Utrecht (2001), Valencia (2003), Aachen (2004), and Seattle (2006). We hope to attain
the same friendly atmosphere as those past workshops. The intent is to bring together, in an informal
setting, researchers interested in various 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 programming.
Contributions from the imperative, object-oriented, constraint, functional, and logic programming
communities, and papers investigating new applications of termination are particularly welcome.
Extended abstracts in the prescribed format, not exceeding 4 pages, should be submitted
electronically through EasyChair's WST 2007 submission site http://www.easychair.org/WST2007/.
A common workshop style file will be made available on the WST'2007 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:
The competition will run again in 2007, and entries are strongly encouraged. Detailed instructions for
submission of problems and programs will be made available at the competition website
Nachum Dershowitz (Tel Aviv, Israel)
Daniel De Schreye (Leuven, Belgium)
Samir Genaim (Madrid, Spain)
Juergen Giesl (Aachen, Germany)
Isabelle Gnaedig (Nancy, France)
Dieter Hofbauer (Kassel, Germany), co-chair
Aart Middeldorp (Innsbruck, Austria)
Etienne Payet (La Reunion, France)
Alexander Serebrenik (Eindhoven, The Netherlands), co-chair
Termination Competition Committee
Claude Marche (Paris, France)
Johannes Waldmann (Leipzig, Germany)
Hans Zantema (Eindhoven, The Netherlands)
Workshop Themes (non-exhaustive list)
Termination of programs
Termination of rewriting
Normalization of lambda calculi
Implementation of termination methods
Challenging termination problems and proofs
Application of termination methods, e.g. to program transformation and compilation
Comparison and classification of termination methods
Termination methods for theorem provers
Termination in distributed systems
Termination proof methods for liveness and fairness
Well-quasi-orderings and ordinal notations
Deadline for electronic submission of papers : April 8, 2007
Notification of acceptance : May 6, 2007
Deadline for final versions : May 27, 2007
Submission of public problems : May 1, 2007
Registration of termination tools : May 21, 2007
Submission of secret problems : June 1, 2007
Submission of termination tools : June 1, 2007
Start of competition : June 4, 2007
Workshop Venue and Related Events:
WST 2007 is part of the Federated Conference on Rewriting, Deduction, and Programming 2007.
Co-located events include RTA'07, HOR'07, PATE'07, RULE'07, SecReT'07, UNIF'07, WFLP'07, and WRS'07.
These colloquia will run from June 25 to June 29, 2007, in Paris (France).
For details see the RDP website at http://www.rdp07.org/.
WST 2007: http://www.rdp07.org/wst.html
Termination Competition: http://www.lri.fr/~marche/termination-competition/2007/
RDP 2007: http://www.rdp07.org/