Difference between revisions of "Termination Competition"
(Improved the categorization of all competition categories) |
(Added explanations for each of the category types) |
||
| Line 34: | Line 34: | ||
== Competition Categories == | == Competition Categories == | ||
| − | Currently, the competition features the following categories. Since 2007 some of the categories also have [[Certified_Termination|certified categories]], where an additional certifier checks the | + | Currently, the competition features the following categories. Since 2007 some of the categories also have [[Certified_Termination|certified categories]], where an additional certifier checks the output of the tools. Categories that were used in the past but not included in the three most recent competitions are marked with an <span style="color:red;">✖</span>. |
=== Termination of Rewriting === | === Termination of Rewriting === | ||
| + | |||
| + | These categories consider the termination of <b>rewrite systems</b>, a foundational computational model used to represent symbolic computation and program transformations. | ||
| + | The goal is to automatically prove that no infinite rewrite sequences are possible for the given system. | ||
| + | Different categories capture variations of rewriting such as relative rewriting, context-sensitive rewriting, conditional rules, or restrictions on the rewriting strategy (e.g., innermost or outermost rewriting). | ||
<div style="column-count:3; column-gap:2em;"> | <div style="column-count:3; column-gap:2em;"> | ||
| Line 56: | Line 60: | ||
=== Termination of Probabilistic Rewriting === | === Termination of Probabilistic Rewriting === | ||
| + | |||
| + | These categories address <b> probabilistic rewrite systems </b>, where rewrite rules are applied according to probability distributions. | ||
| + | Instead of classical termination, the goal is to prove almost-sure termination, i.e., that infinite executions occur with probability zero, | ||
| + | or strong almost-sure termination, i.e., that the expected runtime is finite. | ||
| + | This lifts termination analysis to models that capture randomized algorithms or stochastic behavior. | ||
<div style="column-count:3; column-gap:2em;"> | <div style="column-count:3; column-gap:2em;"> | ||
| Line 61: | Line 70: | ||
* [[Probabilistic Rewriting#PTRS Innermost|PTRS Innermost]] (since 2024) | * [[Probabilistic Rewriting#PTRS Innermost|PTRS Innermost]] (since 2024) | ||
</div> | </div> | ||
| + | |||
| + | Currently, there are only categories regarding probabilistic rewrite systems, | ||
| + | but an extension to probabilistic imperative programs may be possible in future competitions. | ||
=== Termination of Programs === | === Termination of Programs === | ||
| + | |||
| + | These categories focus on proving termination of <b> actual programming languages </b> used in industry. | ||
| + | The categories differ by the source programming language or program model. | ||
<div style="column-count:3; column-gap:2em;"> | <div style="column-count:3; column-gap:2em;"> | ||
| − | * [[Logic_Programming| | + | * [[Logic_Programming|Termination of logic programs]] |
| − | * [[Functional_Programming| | + | * [[Functional_Programming|Termination of functional programs]] (since 2007) |
| − | * [[Java_Bytecode| | + | * [[Java_Bytecode|Termination of Java Bytecode programs]] (since 2009) |
| − | * [[C_Programs| | + | * [[C_Programs|Termination of C programs]] (since 2014) |
</div> | </div> | ||
=== Complexity of Rewriting === | === Complexity of Rewriting === | ||
| + | |||
| + | These categories evaluate tools that automatically analyze the <b> asymptotic complexity of rewrite systems </b>. | ||
| + | Instead of only proving termination, the goal is to derive upper bounds on the length of rewrite sequences, | ||
| + | typically expressed as functions of the input size. | ||
| + | Different categories measure difference runtime complexities under various rewriting strategies and different restrictions on the initial start term. | ||
<div style="column-count:3; column-gap:2em;"> | <div style="column-count:3; column-gap:2em;"> | ||
| Line 83: | Line 103: | ||
=== Complexity Analysis === | === Complexity Analysis === | ||
| + | |||
| + | These categories focus on automatically determining <b> time complexity bounds for programs written in concrete programming languages </b>. | ||
| + | Tools analyze the program’s control flow, data dependencies, and loops to derive asymptotic upper bounds on runtime with respect to the input size. | ||
<div style="column-count:3; column-gap:2em;"> | <div style="column-count:3; column-gap:2em;"> | ||
Revision as of 12:33, 8 March 2026
Contents
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
- The Termination Competition 2025 will be held during WST 2025, September 3-4, Leipzig, Germany.
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
- Florian Frohn (Chair), RWTH Aachen
- Jürgen Giesl, RWTH Aachen
- Georg Moser, University of Innsbruck
- Étienne Payet, Université de La Réunion
- Akihisa Yamada, AIST Tokyo Waterfront
- Dieter Hofbauer, ASW Saarland
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.
Competition Categories
Currently, the competition features the following categories. Since 2007 some of the categories also have certified categories, where an additional certifier checks the output of the tools. Categories that were used in the past but not included in the three most recent competitions are marked with an ✖.
Termination of Rewriting
These categories consider the termination of rewrite systems, a foundational computational model used to represent symbolic computation and program transformations. The goal is to automatically prove that no infinite rewrite sequences are possible for the given system. Different categories capture variations of rewriting such as relative rewriting, context-sensitive rewriting, conditional rules, or restrictions on the rewriting strategy (e.g., innermost or outermost rewriting).
Termination of Probabilistic Rewriting
These categories address probabilistic rewrite systems , where rewrite rules are applied according to probability distributions. Instead of classical termination, the goal is to prove almost-sure termination, i.e., that infinite executions occur with probability zero, or strong almost-sure termination, i.e., that the expected runtime is finite. This lifts termination analysis to models that capture randomized algorithms or stochastic behavior.
- PTRS Standard (since 2024)
- PTRS Innermost (since 2024)
Currently, there are only categories regarding probabilistic rewrite systems, but an extension to probabilistic imperative programs may be possible in future competitions.
Termination of Programs
These categories focus on proving termination of actual programming languages used in industry. The categories differ by the source programming language or program model.
- Termination of logic programs
- Termination of functional programs (since 2007)
- Termination of Java Bytecode programs (since 2009)
- Termination of C programs (since 2014)
Complexity of Rewriting
These categories evaluate tools that automatically analyze the asymptotic complexity of rewrite systems . Instead of only proving termination, the goal is to derive upper bounds on the length of rewrite sequences, typically expressed as functions of the input size. Different categories measure difference runtime complexities under various rewriting strategies and different restrictions on the initial start term.
- TRS Runtime Complexity
- TRS Innermost Runtime Complexity
- TRS Derivational Complexity
- TRS Innermost Derivational Complexity
- TRS Parallel Innermost Derivational Complexity
- ITS Complexity
Complexity Analysis
These categories focus on automatically determining time complexity bounds for programs written in concrete programming languages . Tools analyze the program’s control flow, data dependencies, and loops to derive asymptotic upper bounds on runtime with respect to the input size.
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:
- Termination Competition 2025 affiliated with WST 2025, Results.
- Termination Competition 2024 affiliated with IJCAR 2024, Results.
- Termination Competition 2023 affiliated with WST2023, Results.
- Termination Competition 2022 affiliated with IJCAR 2022, Results.
- Termination Competition 2021 affiliated with CADE 2021, Results.
- Termination Competition 2020 affiliated with IJCAR 2020, Results.
- Termination Competition 2019 affiliated with Toolympics at TACAS 2019, Results.
- Termination Competition 2018 affiliated with FLoC 2018, Oxford, UK, July 13, 2018, Results.
- Termination Competition 2017 affiliated with FSCD, Results of Competition, Results of demonstration.
- Termination Competition 2016 affiliated with WST (Workshop on Termination), Results of Competition. Presentation at WST
- Termination Competition 2009 Results, Announcement
- Termination Competition 2008, Results, Report
- Termination Competition 2007, Report
- Termination Competition 2006, Report
- Termination Competition 2005, Report
- Termination Competition 2004, Report
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".
Results
The results of (almost) all competitions are available here
