Difference between revisions of "Termination Competition"
J.waldmann (talk | contribs) |
J.waldmann (talk | contribs) |
||
Line 15: | Line 15: | ||
* [[Functional_Programming|termination of functional programs]] | * [[Functional_Programming|termination of functional programs]] | ||
* [[Complexity|complexity of term rewriting]] | * [[Complexity|complexity of term rewriting]] | ||
+ | Planned extensions: | ||
+ | * [[Java_Bytecode|termination of java bytecode programs]] | ||
The [[TPDB|Termination Problems Data Base]] collects all the problems used in the competitions. | The [[TPDB|Termination Problems Data Base]] collects all the problems used in the competitions. |
Revision as of 11:00, 23 June 2009
Annual International Termination Competition
During the 90's a number of new, powerful termination methods was developed. Thus, at the the beginning of the millennium many research groups started to develop tools for fully-automated termination analysis.
After a tool demonstration at the 2003 Workshop on Termination in Valencia, the community decided to install an annual termination competition to spur the development of tools and new termination techniques.
Currently, the competition features the following categories:
- termination of string and term rewriting
- certified termination of string and term rewriting (see Workshops on Certified Termination)
- termination of logic programs
- termination of functional programs
- complexity of term rewriting
Planned extensions:
The Termination Problems Data Base collects all the problems used in the competitions.
So far, the following competitions have taken place:
- Termination Competition 2004
- Termination Competition 2005
- Termination Competition 2006
- Termination Competition 2007
At the 2007 Workshop on Termination in Paris it was decided to discontinue the annual competitions in favour of an ongoing competition.
Discussion is open and primarily happens on the termtools mailing list. Decisions will be made by votes among the Termination Competition Steering Committee.