Difference between revisions of "Termination Competition 2018"
(→Status: new url for 2018 competition)
|Line 3:||Line 3:|
== Status ==
== Status ==
* [://.// Results]
== Dates ==
== Dates ==
Latest revision as of 09:55, 12 June 2020
- Tool Registration: June 15, 2018
- Problem Submission: June 22, 2018
- Updates of Registered Tools: June 29, 2018
- Competition: July 13-14, 2018
Competition Categories and Awards
The competition contains several categories for termination and complexity from the areas of term rewriting (all categories with HO/FO-TRSs, with- or without strategies) and programming languages (Logic Programming, Haskell, Java, C, integer transition systems, ...)
Proposals for new categories are welcome and will be discussed in the mailing list.
The competition categories are grouped in three meta-categories:
- termination of term rewriting (all categories with HO/FO-TRSs, with- or without strategies)
- complexity analysis of term rewriting (all complexity categories)
- termination of programming languages (Logic Programming, Haskell, Java, C, ...)
In each meta-category, a medal will be awarded to the highest-scoring solver.
The scoring follows Termination Competition 2014: For every meta-category, we consider the sum of the scores for each category within that meta-category: The score of a tool is determined by the number of other tools which could be beaten in that category.
This puts the emphasis on categories with many competitors. (In particular, a category with just one entrant would produce a zero score.) A category is only run at the competition if there are at least 2 participants and at least 40 examples for this category in the underlying termination problem data base.
All participants in the same category will be run on the existing problems of this category. There might be modifications of the rules suggested by the organizer and decided by the SC.
The wall-clock timeout will be 300 seconds, and 4 cores will be available (if a tool wants to use concurrent execution). The tools will be started in their directory and obtain
- the problem file name on the command line,
- and extra info from environment variables, cf. Termination Competition 2014 technical details
The tools are expected to give an answer (YES, NO, MAYBE) in the first line on stdout, followed by a proof in ASCII, HTML, or CPF format. Exceptions to these rules are the certified (see also the CPF-website) and complexity categories. See all existing categories for more details.
For those problems where a correct answer is (partially) known, any contradictory answer will be penalized by -10 points.
For those categories devoted to prove only termination or non-termination, the score of a tool is the number of non-contradictory answers minus the given penalization (if any).
- Jürgen Giesl, RWTH Aachen, Germany
- Albert Rubio (chair), UPC Barcelona, Spain
- Christian Sternagel, Universität Innsbruck, Austria
- Johannes Waldmann, HTWK Leipzig, Germany
- Akihisa Yamada, NII, Japan
- Johannes Waldmann, HTWK Leipzig, Germany (advisory)
- Akihisa Yamada, NII, Japan
Participants must be registered on Starexec (so you can upload and test your solver): enter your data at StarExecRegistration, indicating the competition categories where you plan to enter tools and problems, and then upload your contributions to StarExec
Then, please email the competition's organizer (A. Yamada) indicating which categories you want to participate and the startexec IDs of your account, your tool, and a configuration per category (if decided). Participants of the previous competition can just indicate so if they want to participate to the same categories.
We recommend to register early. After the deadline, access to StarExec might be restricted. We need time to prepare the competition, and other competitions may be running in parallel.
It is highly recommended that participants also subscribe to the termtools mailing list, because that is where announcements will be made, and where discussion takes place.
this refers to StarExec in general, and not to Termination in particular.
- user guide
- announcements and discussion (combined feed for recent messages)
- announcements and discussion (discontinued, but contains some information that is still valid and not available elsewhere)
The competition will be running on StarExec - a cross-community solver (tool) execution and benchmark (problem) library service under joint development (since 2012) at the University of Iowa and the University of Miami.
Competition data will be presented via star-exec-presenter - developed and running at HTWK Leipzig.
Technical details about the execution platform (as of 2014) can be found here.
To contact the steering committee of the termination competition, send an email to terminationcompetitionsc<at>lists.rwth-aachen.de.
The competition organizers can be reached at johannes.waldmann<at>htwk-leipzig.de
Send new problems for the competition to akihisayamada<at>nii.ac.jp
Changes with respect to 2017
These lists reflect the discussion in the community, and in the steering committee. Items are preliminary, and not officially binding. Please do not edit this list (unless you're in the SC). Instead, send proposals to termtools or terminationcompetitionsc mailing list, or create a new wiki page and put a link here.