[Hol-info] WST 1st CFP (July 14 - 15, 2010, Edinburgh)

[Alexander K. <kr...@in...>]

(our apologies if you receive multiple copies of this message)

----------------------------------------------------------------------
                11th International Workshop on Termination

                Affiliated with RTA and IJCAR at FLoC 2010
                    July 14 - 15, 2010, Edinburgh, UK
                  http://imada.sdu.dk/~petersk/WST2010/
----------------------------------------------------------------------

OBJECTIVES

The goal of the Workshop on Termination is to be a venue for
presentation and discussion of all topics in and around termination.
In this way, the workshop tries to bridge the gaps between different
communities interested and active in termination research.

The 11th International Workshop on Termination in Edinburgh continues
the successful workshops 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).
We hope to attain the same friendly atmosphere as in past workshops,
which enabled fruitful exchanges leading to joint research and
subsequent publications.

TOPICS

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.

Areas of interest to the workshop include, but are not limited to,
the following:
      * Termination of programs
      * Termination of rewriting
      * Termination analysis of transition systems
      * Complexity of programs
      * Complexity of rewriting
      * Implementations of termination and complexity analysis methods
      * Termination orderings, well-founded orderings, reduction orderings
      * Termination methods for theorem provers
      * Strong and weak normalization of lambda calculi
      * Termination analysis for different language paradigms
      * Challenging termination problems/proofs
      * 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-quasi-order theory
      * Ordinal notations
      * Fast/slow growing hierarchies

SUBMISSIONS

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:

      http://www.easychair.org/conferences/?conf=wst2010

Final versions should be created using LaTeX and the style file
easychair.cls (http://www.easychair.org/coolnews.cgi).

IMPORTANT DATES

Paper submission      April 11
Notification          April 25
Final versions due    May   30
Workshop date         July  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.

PROGRAM COMMITTEE

Michael Codish
Samir Genaim
Alexander Krauss
Georg Moser
Albert Rubio
Andrey Rybalchenko
Peter Schneider-Kamp (chair)
Johannes Waldmann