Eighth International Workshop on Termination (WST 2006)

Call for Papers

Seattle, WA, 15-16 August, 2006

Part of FLoC 2006: The Federated Logic Conference

PDF version

Workshop Chairs:

Alfons Geser, Leipzig University of Applied Sciences, Germany
geser@fbeit.htwk-leipzig.de

Harald Søndergaard, University of Melbourne, Australia
harald@cs.mu.oz.au

Termination Competition Chairs

Claude Marché, Université Paris-Sud, FR
Hans Zantema, Technische Universiteit Eindhoven, NL

Program Committee:

Thomas Arts, IT Universitet Göteborg, SE
Alfons Geser, HTWK Leipzig, DE
Dieter Hofbauer, Universität Kassel, DE
Claude Marché, Université Paris-Sud, FR
Andreas Podelski, Max-Planck-Institut für Informatik, DE
Henny Sipma, Stanford University, US
Harald Søndergaard, University of Melbourne, AU
Andreas Weiermann, Universiteit Utrecht, NL

The Workshop

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 communities. Contributions from the constraint, functional, and logic programming communities, and papers investigating new applications of termination are particularly welcome. The technical program of the conference will combine presentations of the accepted papers with invited talks and advanced tutorials.

List of Topics (Non-Exhaustive)

Paper Submissions

Extended abstracts (up to 5 pages long) should be submitted electronically through EasyChair's WST 2006 submission site. Papers should be submitted in PostScript or PDF format. Submission of a paper will be taken as an undertaking that at least one author will attend WST 2006 to present the work.

Accepted papers will appear in the proceedings made available through the Computing Research Repository, CoRR. The repository allows automatic citation tracking and favours LaTeX documents. Authors of accepted papers will receive more information about the submission process for final papers. For initial submissions, we recommend the use of Springer book style (cl2emult.cls).

The Termination Competition

The termination competition will run again in 2006, and entries are strongly encouraged. Details about submissions will be made available at the competition site.

Important dates

Paper submission19 May 2006
Notification9 June 2006
Final paper version30 June 2006
Competition deadlines:
Submission of public problems for database1 May 2006
Submission of secret problems31 May 2006
Submission of termination tools31 May 2006

Conference Venue and Related Events

WST 2006 is sponsored by RTA 2006 and part of the Federated Logic Conference 2006. Other co-located events include CAV 2006, ICLP 2006, IJCAR 2006, LICS 2006, and SAT 2006. These colloquia will run from 10 to 22 August, 2006 in attractive Seattle, Washington, USA.