Difference between revisions of "Termination Competition"
From Termination-Portal.org
Jump to navigationJump to search| (65 intermediate revisions by 9 users not shown) | |||
| Line 2: | Line 2: | ||
During the 90's a number of new, powerful termination methods | During the 90's a number of new, powerful termination methods | ||
| − | was developed. Thus, at | + | was developed. Thus, at the beginning of the millennium |
many research groups started to develop [[:Category:Tools | tools for fully-automated termination analysis]]. | many research groups started to develop [[:Category:Tools | tools for fully-automated termination analysis]]. | ||
| − | After a tool demonstration at the 2003 | + | After a tool demonstration at the Termination Workshop 2003 (Valencia), |
| − | the community decided to install an annual termination competition | + | the community then decided to install an annual termination competition, and to collect benchmarks, |
to spur the development of tools and new termination techniques. | to spur the development of tools and new termination techniques. | ||
| − | + | == Upcoming Competitions == | |
| − | + | ||
| + | * The [[Termination Competition 2024]] will be held during [https://merz.gitlabpages.inria.fr/2024-ijcar/ IJCAR 2024], July 1-6, Nancy, France. | ||
| − | == | + | == Organization == |
| − | + | Questions and suggestions regarding the competition | |
| + | should go to [[Termtools|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 | ||
| + | * [https://ffrohn.github.io Florian Frohn] (Chair), RWTH Aachen | ||
| + | * [https://verify.rwth-aachen.de/giesl/ Jürgen Giesl], RWTH Aachen | ||
| + | * [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 | ||
| + | * [https://group-mmm.org/~ayamada/ Akihisa Yamada], AIST Tokyo Waterfront | ||
| − | + | From 2004 till 2007, the competition organizer was Claude Marché, [http://www.lri.fr/~marche/termination-competition/ Paris]. | |
| + | From 2008 to 2013 the competition was run by René Thiemann, [http://termcomp.uibk.ac.at Innsbruck]. | ||
| + | From 2014 to 2017, the competition organizer was Johannes Waldmann. Jobs were run on the [https://www.starexec.org/ 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 == | == Competition Categories == | ||
Currently, the competition features the following categories: | Currently, the competition features the following categories: | ||
| − | * termination of [[ | + | * termination of [[Term Rewriting|string and term rewriting]] |
* [[Logic_Programming|termination of logic programs]] | * [[Logic_Programming|termination of logic programs]] | ||
* [[Certified_Termination|certified termination]] of string and term rewriting (since 2007) | * [[Certified_Termination|certified termination]] of string and term rewriting (since 2007) | ||
* [[Functional_Programming|termination of functional programs]] (since 2007) | * [[Functional_Programming|termination of functional programs]] (since 2007) | ||
* [http://cl-informatik.uibk.ac.at/users/georg/cbr/competition/ complexity of rewrite systems] (since 2008) | * [http://cl-informatik.uibk.ac.at/users/georg/cbr/competition/ complexity of rewrite systems] (since 2008) | ||
| − | * [[Java_Bytecode|termination of | + | * [[Java_Bytecode|termination of Java Bytecode programs]] (since 2009) |
* [[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) | |
| − | * [[ITRS|integer term rewriting]] ( | + | * [[C_Complexity|complexity of C programs]] |
| − | + | * termination of [[Transition_Systems|integer transition systems]] (since 2014) | |
| − | + | * [[ITRS|integer term rewriting]] (since 2014) | |
| − | + | <!--* [[C_Integer_Programs|termination of C integer programs]]--> | |
| + | * [[Cycle_Rewriting|termination of cycle rewriting]] | ||
| + | * [[Probabilistic_Rewriting|termination of probabilistic term rewriting]] (since 2024) | ||
== Termination Problems Data Base == | == Termination Problems Data Base == | ||
| Line 43: | Line 58: | ||
The following competitions have taken place: | The following competitions have taken place: | ||
| + | |||
| + | * [[Termination Competition 2023]] affiliated with [[WST2023]], [https://termcomp.github.io/Y2023/ Results]. | ||
| + | * [[Termination Competition 2022]] affiliated with [https://easychair.org/smart-program/FLoC2022/IJCAR-index.html IJCAR 2022], [https://termcomp.github.io/Y2022/ Results]. | ||
| + | * [[Termination Competition 2021]] affiliated with [http://www.cs.cmu.edu/~mheule/CADE28/ CADE 2021], [https://termcomp.github.io/Y2021/ Results]. | ||
| + | * [[Termination Competition 2020]] affiliated with [https://ijcar2020.org/ IJCAR 2020], [https://termcomp.github.io/Y2020/ Results]. | ||
| + | * [[Termination Competition 2019]] affiliated with [https://tacas.info/toolympics.php Toolympics at TACAS 2019], [https://termcomp.github.io/Y2019/ Results]. | ||
| + | * [[Termination Competition 2018]] affiliated with FLoC 2018, Oxford, UK, July 13, 2018, [https://termcomp.github.io/Y2018/ Results]. | ||
| + | |||
| + | * [[Termination_Competition_2017|Termination Competition 2017]] affiliated with [http://www.cs.ox.ac.uk/conferences/fscd2017/ FSCD], [http://termcomp.imn.htwk-leipzig.de/competitions/Y2017 Results of Competition], [http://termcomp.imn.htwk-leipzig.de/competitions/67 Results of demonstration]. | ||
| + | |||
| + | * [[Termination_Competition_2016|Termination Competition 2016]] affiliated with [http://cl-informatik.uibk.ac.at/events/wst-2016/ WST (Workshop on Termination)], [http://termcomp.imn.htwk-leipzig.de/competitions/Y2016 Results of Competition]. [http://www.cs.upc.edu/~albert/papers/termcomp2016_slides.pdf Presentation at WST] | ||
| + | |||
| + | * [[Termination Competition 2015]], [http://termcomp.imn.htwk-leipzig.de/competitions/Y2015 Results of Competition], [http://www.cs.upc.edu/~albert/papers/termCompCADE2015.pdf Description paper at CADE-25] [http://www.cs.upc.edu/~albert/papers/termcomp2015_slides.pdf Report] | ||
| + | |||
| + | * [[Termination Competition 2014]], [http://termcomp.imn.htwk-leipzig.de/competitions/Y2014 Results of Competition], [http://nfa.imn.htwk-leipzig.de/termcomp/competition/23 Results of Demonstration] | ||
| + | |||
| + | * [[Termination Competition 2013]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=437763 Results], [http://termcomp.uibk.ac.at/2013/competition2013.pdf Report] | ||
* [[Termination Competition 2012]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=362062 Results], [http://verify.rwth-aachen.de/giesl/competition2012.pdf Report] | * [[Termination Competition 2012]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=362062 Results], [http://verify.rwth-aachen.de/giesl/competition2012.pdf Report] | ||
| Line 57: | Line 89: | ||
* [http://www.lri.fr/~marche/termination-competition/2005/ Termination Competition 2005], [http://www.lri.fr/~marche/termination-competition/2005/TC.ppt Report] | * [http://www.lri.fr/~marche/termination-competition/2005/ Termination Competition 2005], [http://www.lri.fr/~marche/termination-competition/2005/TC.ppt Report] | ||
* [http://www.lri.fr/~marche/termination-competition/2004/ Termination Competition 2004], [http://www.lri.fr/~marche/termination-competition/2004/slides-1jun2004.ps Report] | * [http://www.lri.fr/~marche/termination-competition/2004/ Termination Competition 2004], [http://www.lri.fr/~marche/termination-competition/2004/slides-1jun2004.ps 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". | ||
| + | |||
| + | == Static Backups of Results == | ||
| + | |||
| + | For many previous competitions, static backups of the results are available [https://aprove-developers.github.io/termcomp_results/ here]. | ||
Latest revision as of 10:34, 20 September 2024
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 2024 will be held during IJCAR 2024, July 1-6, Nancy, France.
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
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 of string and term rewriting
- termination of logic programs
- certified termination of string and term rewriting (since 2007)
- termination of functional programs (since 2007)
- complexity of rewrite systems (since 2008)
- termination of Java Bytecode programs (since 2009)
- termination of higher order rewriting (since 2010)
- termination of C programs (since 2014)
- complexity of C programs
- termination of integer transition systems (since 2014)
- integer term rewriting (since 2014)
- termination of cycle rewriting
- termination of probabilistic term rewriting (since 2024)
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 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".
Static Backups of Results
For many previous competitions, static backups of the results are available here.
