Difference between revisions of "Termination Competition"

From Termination-Portal.org
Jump to navigationJump to search
 
(3 intermediate revisions by 2 users not shown)
Line 23: Line 23:
 
* [http://cl-informatik.uibk.ac.at/users/georg/ Georg Moser], University of Innsbruck
 
* [http://cl-informatik.uibk.ac.at/users/georg/ Georg Moser], University of Innsbruck
 
* [http://lim.univ-reunion.fr/staff/epayet/ Étienne Payet], Université de La Réunion
 
* [http://lim.univ-reunion.fr/staff/epayet/ Étienne Payet], Université de La Réunion
* [https://www.cs.upc.edu/~albert/ Albert Rubio],  Complutense University of Madrid
 
 
* [https://group-mmm.org/~ayamada/ Akihisa Yamada], AIST Tokyo Waterfront
 
* [https://group-mmm.org/~ayamada/ Akihisa Yamada], AIST Tokyo Waterfront
  
Line 43: Line 42:
 
* [[Higher_Order|termination of higher order rewriting]] (since 2010)
 
* [[Higher_Order|termination of higher order rewriting]] (since 2010)
 
* [[C_Programs|termination of C programs]] (since 2014)
 
* [[C_Programs|termination of C programs]] (since 2014)
 +
* [[C_Complexity|complexity of C programs]]
 
* termination of [[Transition_Systems|integer transition systems]] (since 2014)
 
* termination of [[Transition_Systems|integer transition systems]] (since 2014)
 
* [[ITRS|integer term rewriting]] (since 2014)
 
* [[ITRS|integer term rewriting]] (since 2014)
* [[C_Integer_Programs|termination of C integer programs]]
+
<!--* [[C_Integer_Programs|termination of C integer programs]]-->
 
* [[Cycle_Rewriting|termination of cycle rewriting]]
 
* [[Cycle_Rewriting|termination of cycle rewriting]]
 +
* [[Probabilistic_Rewriting|termination of probabilistic term rewriting]] (since 2024)
  
 
== Termination Problems Data Base ==
 
== Termination Problems Data Base ==

Latest revision as of 10:34, 20 September 2024

Annual International Termination Competition

During the 90's a number of new, powerful termination methods was developed. Thus, at the beginning of the millennium many research groups started to develop tools for fully-automated termination analysis.

After a tool demonstration at the Termination Workshop 2003 (Valencia), the community then decided to install an annual termination competition, and to collect benchmarks, to spur the development of tools and new termination techniques.

Upcoming Competitions

Organization

Questions and suggestions regarding the competition should go to the termtools mailing list. Discussion is open and happens primarily on the list. Decisions will be made by votes among the Termination Competition Steering Committee, with current members

From 2004 till 2007, the competition organizer was Claude Marché, Paris. From 2008 to 2013 the competition was run by René Thiemann, Innsbruck. From 2014 to 2017, the competition organizer was Johannes Waldmann. Jobs were run on the Star Exec platform at U Iowa. From 2018 to 2023, the organizer was Akihisa Yamada. From 2024 on, the organizer is Florian Frohn. Jobs are run on Star-Exec.

Competition Categories

Currently, the competition features the following categories:

Termination Problems Data Base

The Termination Problems Data Base collects all the problems used in the competitions.

We welcome problem submissions from non-participants.

History of Termination Competitions

The following competitions have taken place:

At the "tool demonstration" in 2003, participating provers (including AProVe, Torpa, Matchbox) were run on the laptop computers of their developers in the room. Termination problems were announced on the spot by participants, then written on the blackboard, then typed in by everyone, and when a team's program could solve it, they shouted "solved".

Static Backups of Results

For many previous competitions, static backups of the results are available here.