After the successful international workshops on termination held inFederated Conference on Rewriting, Deduction and Programming. We hope to attain the same friendly atmosphere as in past workshops, which enabled fruitful exchanges leading to joint research and subsequent publications.
This workshop delves into all aspects of termination of processes. Though, the halting of computer programs, for example, is undecidable, methods of establishing termination play a fundamental role in many applications and the challenges are both practical and theoretical. From a practical point of view, proving termination is a central problem in software development and formal methods for termination analysis are essential for program verification. From a theoretical point of view, termination is central in mathematical logic and ordinal theory.
Areas of interest to this workshop, include, but are not limited to, the following:
Abstracts SubmissionExtended abstracts of papers (1-3 pages) should be submitted electronically. Authors of accepted papers will be expected to attend and present their paper at the workshop.
Systems SubmissionA short description of the system (1-3 pages) should be submitted electronically. Authors may be asked for details if necessary. Authors of accepted systems will be expected to attend and participate in the exhibition/competition at the workshop. During the workshop there will be a special session including a presentation for each participating system.
Authors are encouraged to use LaTeX2e and the Springer llncs class files .