JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for CPHC-CONF Archives


CPHC-CONF Archives

CPHC-CONF Archives


cphc-conf@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

CPHC-CONF Home

CPHC-CONF Home

CPHC-CONF  April 2007

CPHC-CONF April 2007

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

LAST Call for papers - Workshop on Termination (WST 2007) - Paris

From:

A Serebrenik <[log in to unmask]>

Reply-To:

A Serebrenik <[log in to unmask]>

Date:

Fri, 20 Apr 2007 07:55:19 +0200

Content-Type:

TEXT/PLAIN

Parts/Attachments:

Parts/Attachments

TEXT/PLAIN (99 lines)

***************** SUBMISSION DEADLINE APRIL 23, 2007 *******************

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.

Paper Submissions:
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
http://www.lri.fr/~marche/termination-competition/2007/

Program Committee
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
Non-termination detection
Termination methods for theorem provers
Termination in distributed systems
Termination proof methods for liveness and fairness
Derivational complexity
Well-quasi-orderings and ordinal notations

Important Dates:
Deadline for electronic submission of papers :  April 23, 2007
Notification of acceptance                   :  May 14, 2007
Deadline for final versions                  :  May 27, 2007

Competition Deadlines:
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/.

Web Sites
WST 2007: http://www.rdp07.org/wst.html
Termination Competition: http://www.lri.fr/~marche/termination-competition/2007/
RDP 2007: http://www.rdp07.org/

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

April 2024
March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
July 2023
June 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
July 2022
June 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
July 2021
June 2021
May 2021
April 2021
March 2021
February 2021
January 2021
December 2020
November 2020
October 2020
September 2020
August 2020
July 2020
June 2020
May 2020
April 2020
March 2020
February 2020
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
2006
2005
2004
2003
2002
2001
2000
1999
1998


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

For help and support help@jisc.ac.uk

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager