http://termination-portal.org/mediawiki/api.php?action=feedcontributions&user=J.waldmann&feedformat=atomTermination-Portal.org - User contributions [en]2024-03-29T04:34:24ZUser contributionsMediaWiki 1.34.2http://termination-portal.org/mediawiki/index.php?title=20th_International_Workshop_on_Termination&diff=196120th International Workshop on Termination2024-01-31T17:47:18Z<p>J.waldmann: Created page with "The 20th Intl. Workshop on Termination will take place at [https://informatik.htwk-leipzig.de/ HTWK Leipzig, Germany], in summer 2025. [https://www.imn.htwk-leipzig.de/~waldma..."</p>
<hr />
<div>The 20th Intl. Workshop on Termination will take place at [https://informatik.htwk-leipzig.de/ HTWK Leipzig, Germany], in summer 2025. [https://www.imn.htwk-leipzig.de/~waldmann/ Johannes Waldmann] is the local organizer.</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=WST&diff=1960WST2024-01-31T17:39:42Z<p>J.waldmann: </p>
<hr />
<div>The International Workshop on Termination (WST) brings together, in an informal setting, researchers interested in all aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop also provides a ground for cross-fertilisation of ideas from term rewriting and from the different programming language communities.<br />
<br />
Upcoming events:<br />
* [[20th International Workshop on Termination]], Leipzig, Germany, summer 2025.<br />
<br />
Previous workshops:<br />
* [[19th International Workshop on Termination]], Obergurgl, Austria, August 24-25, 2023.<br />
* [https://sws.cs.ru.nl/WST2022 18th International Workshop on Termination] during [https://www.floc2022.org/ Federated Logic Conference (FLoC)], Haifa, Israel, August 11-12, 2022.<br />
* [http://costa.fdi.ucm.es/wst2020/ 17th International Workshop on Termination] planned to be co-located with IJCAR and [http://fscdconference.org/editions/upcoming FSCD 2020], Paris (France), June/July, 2020. <br />
* [http://wst2018.webs.upv.es/ 16th International Workshop on Termination] during [http://www.floc2018.org/ Federated Logic Conference (FLoC)], Oxford, United Kingdom, July 18-19, 2018.<br />
* [http://cl-informatik.uibk.ac.at/events/wst-2016/ 15th International Workshop on Termination] at [http://cl-informatik.uibk.ac.at/events/cla-2016/ Computational Logic in the Alps], Obergurgl, Austria, September 5-7, 2016.<br />
* [https://easychair.org/smart-program/VSL2014/WST-index.html 14th International Workshop on Termination] during [http://vsl2014.at/ Vienna Summer of Logic], Vienna, Austria, July 17-18, 2014.<br />
* Joint Workshop on Termination [http://www.imn.htwk-leipzig.de/WST2013/ WST2013] and on Foundational and Practical Aspects of Resource Analysis [http://fopara2013.cs.unibo.it/ FOPARA], Bertinoro, Italy, August 29-31, 2013.<br />
* [http://cl-informatik.uibk.ac.at/users/georg/events/wst2012 12th International Workshop on Termination, Obergurgl, February 19-23, 2012].<br />
* [http://imada.sdu.dk/~petersk/WST2010/ 11th International Workshop on Termination, Edinburgh, 2010].<br />
* [https://portal.imn.htwk-leipzig.de/termine/10-international-workshop-on-termination/ 10th International Workshop on Termination, Leipzig, 2009].<br />
* [http://www.lsv.ens-cachan.fr/rdp07/wst.html 9th International Workshop on Termination, Paris, 2007].<br />
* [http://www.easychair.org/FLoC-06/WST.html 8th International Workshop on Termination, Seattle, 2006].<br />
* [http://www-i2.informatik.rwth-aachen.de/WST04/ 7th International Workshop on Termination, Aachen, 2004].<br />
* [http://www.dsic.upv.es/~rdp03/wst/ 6th International Workshop on Termination, Valencia, 2003].<br />
* [http://www.cs.tau.ac.il/~nachumd/wst/index.html 5th International Workshop on Termination, Utrecht, 2001].<br />
* [http://verify.rwth-aachen.de/giesl/WST99.html 4th International Workshop on Termination, Dagstuhl, 1999].<br />
* [http://www-i2.informatik.rwth-aachen.de/giesl/WST97/main.html 3rd International Workshop on Termination, Ede, 1997].<br />
* 2nd International Workshop on Termination, La Bresse, 1995.<br />
* 1st International Workshop on Termination, St. Andrews, 1993.<br />
<br />
Independently from WST, there are meetings on Certified Termination : [[WScT]]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=WST&diff=1954WST2023-12-07T09:36:25Z<p>J.waldmann: add WST 2025 plan</p>
<hr />
<div>The International Workshop on Termination (WST) brings together, in an informal setting, researchers interested in all aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop also provides a ground for cross-fertilisation of ideas from term rewriting and from the different programming language communities.<br />
<br />
Upcoming events:<br />
* 20th International Workshop on Termination, Leipzig, Germany, summer 2025.<br />
<br />
Previous workshops:<br />
* [[19th International Workshop on Termination]], Obergurgl, Austria, August 24-25, 2023.<br />
* [https://sws.cs.ru.nl/WST2022 18th International Workshop on Termination] during [https://www.floc2022.org/ Federated Logic Conference (FLoC)], Haifa, Israel, August 11-12, 2022.<br />
* [http://costa.fdi.ucm.es/wst2020/ 17th International Workshop on Termination] planned to be co-located with IJCAR and [http://fscdconference.org/editions/upcoming FSCD 2020], Paris (France), June/July, 2020. <br />
* [http://wst2018.webs.upv.es/ 16th International Workshop on Termination] during [http://www.floc2018.org/ Federated Logic Conference (FLoC)], Oxford, United Kingdom, July 18-19, 2018.<br />
* [http://cl-informatik.uibk.ac.at/events/wst-2016/ 15th International Workshop on Termination] at [http://cl-informatik.uibk.ac.at/events/cla-2016/ Computational Logic in the Alps], Obergurgl, Austria, September 5-7, 2016.<br />
* [https://easychair.org/smart-program/VSL2014/WST-index.html 14th International Workshop on Termination] during [http://vsl2014.at/ Vienna Summer of Logic], Vienna, Austria, July 17-18, 2014.<br />
* Joint Workshop on Termination [http://www.imn.htwk-leipzig.de/WST2013/ WST2013] and on Foundational and Practical Aspects of Resource Analysis [http://fopara2013.cs.unibo.it/ FOPARA], Bertinoro, Italy, August 29-31, 2013.<br />
* [http://cl-informatik.uibk.ac.at/users/georg/events/wst2012 12th International Workshop on Termination, Obergurgl, February 19-23, 2012].<br />
* [http://imada.sdu.dk/~petersk/WST2010/ 11th International Workshop on Termination, Edinburgh, 2010].<br />
* [https://portal.imn.htwk-leipzig.de/termine/10-international-workshop-on-termination/ 10th International Workshop on Termination, Leipzig, 2009].<br />
* [http://www.lsv.ens-cachan.fr/rdp07/wst.html 9th International Workshop on Termination, Paris, 2007].<br />
* [http://www.easychair.org/FLoC-06/WST.html 8th International Workshop on Termination, Seattle, 2006].<br />
* [http://www-i2.informatik.rwth-aachen.de/WST04/ 7th International Workshop on Termination, Aachen, 2004].<br />
* [http://www.dsic.upv.es/~rdp03/wst/ 6th International Workshop on Termination, Valencia, 2003].<br />
* [http://www.cs.tau.ac.il/~nachumd/wst/index.html 5th International Workshop on Termination, Utrecht, 2001].<br />
* [http://verify.rwth-aachen.de/giesl/WST99.html 4th International Workshop on Termination, Dagstuhl, 1999].<br />
* [http://www-i2.informatik.rwth-aachen.de/giesl/WST97/main.html 3rd International Workshop on Termination, Ede, 1997].<br />
* 2nd International Workshop on Termination, La Bresse, 1995.<br />
* 1st International Workshop on Termination, St. Andrews, 1993.<br />
<br />
Independently from WST, there are meetings on Certified Termination : [[WScT]]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition_2019&diff=1826Termination Competition 20192019-03-05T15:02:13Z<p>J.waldmann: /* StarExec Information */</p>
<hr />
<div>In 2019, the Termination and Complexity Competition will be affiliated with [https://tacas.info/toolympics.php Toolympics],<br />
with results presented during [https://conf.researchr.org/track/etaps-2019/tacas-2019-papers TACAS 2019], April 7, Prague.<br />
<br />
<br />
The competition will be run on the [http://www.starexec.org/ StarExec platform],<br />
a few weeks/days before the presentation of results,<br />
at the discretion of the organizer, Akihisa Yamada.<br />
<br />
== Dates ==<br />
<br />
* Tool and Problem Submission: March 15, 2019<br />
* Communication of Initial Results: March 22, 2019<br />
* Finalization of Results: March 31, 2019 <br />
* Presentation: April 7, 2019<br />
<br />
== Competition Categories and Awards ==<br />
<br />
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, ...)<br />
<br />
Proposals for new categories are welcome and will be discussed in [[Termtools|the mailing list]].<br />
<br />
<!-- maybe not this year<br />
The competition categories are grouped in three meta-categories:<br />
<br />
* termination of term rewriting (all categories with HO/FO-TRSs, with- or without strategies)<br />
* complexity analysis of term rewriting (all complexity categories)<br />
* termination of programming languages (Logic Programming, Haskell, Java, C, ...)<br />
<br />
In each meta-category, a medal will be awarded to the highest-scoring solver.<br />
<br />
The scoring follows [[Termination Competition 2014]]:<br />
For every meta-category, we consider the sum of the scores for each category within that meta-category:<br />
The score of a tool is determined by the number of other tools which could be beaten in that category.<br />
<br />
This puts the emphasis on categories with many competitors.<br />
(In particular, a category with just one entrant would produce a zero score.) <br />
--><br />
<br />
A category is only run at the competition if there are at least 2 participants and at least 40 examples <br />
for this category in the underlying termination problem data base.<br />
<br />
<br />
== Competition Procedure ==<br />
<br />
All participants in the same category will be run on<br />
the existing problems of this category.<br />
<!-- a [http://www.termination-portal.org/wiki/Termination_Competition_Problem_Selection_Algorithm subset] of the existing problems of this category. The number of problems used in the competition is not fixed and will depend on the number of existing problems. The problem selection algorithm will be the same as in previous years [[Termination_Competition_Problem_Selection_Algorithm]]. The selection is made so that the whole competition will be executed live during the FSCD 2017. --><br />
There might be modifications of the rules suggested by the organizer and decided by the SC.<br />
<br />
The wall-clock timeout will be 300 seconds, and 4 cores will be available (if a tool wants to use concurrent execution).<br />
The tools will be started in their directory and obtain<br />
<br />
* the problem file name on the command line,<br />
* and extra info from environment variables, cf. [[Termination Competition 2014 technical details]]<br />
<br />
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 [http://www.termination-portal.org/wiki/Termination_Competition_Certified_Categories_Competition certified] (see also the [http://cl-informatik.uibk.ac.at/software/cpf/ CPF-website]) and [http://cl-informatik.uibk.ac.at/users/georg/cbr/competition/ complexity] categories. See all existing [http://www.termination-portal.org/wiki/Category:Categories categories] for more details.<br />
<br />
For those problems where a correct answer is (partially) known, any contradictory answer will be penalized by -10 points.<br />
However, we will try to accept bugfixes if they are sufficiently in advance to the finalization of results.<br />
<br />
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).<br />
<br />
== Committees ==<br />
<br />
Steering Committee<br />
* Jürgen Giesl, RWTH Aachen, Germany<br />
* Albert Rubio (chair), UPC Barcelona, Spain<br />
* Christian Sternagel, Universität Innsbruck, Austria<br />
* Johannes Waldmann, HTWK Leipzig, Germany<br />
* Akihisa Yamada, NII, Japan<br />
<br />
Organizing Commmittee<br />
* Akihisa Yamada, NII, Japan<br />
<br />
== Registration ==<br />
<br />
Participants must be registered on Starexec (so you can upload and test your solver): enter your data at [https://www.starexec.org/starexec/public/registration.jsp StarExecRegistration], indicating the competition categories where you plan to enter tools and problems, and then upload your contributions to [http://www.starexec.org StarExec]<br />
<br />
Then, please email the competition's organizer (A. Yamada)<br />
indicating which categories you want to participate and the startexec IDs of your account, your tool, and a configuration per category. Participants of the previous competition can just indicate so if they want to participate to the same categories.<br />
<br />
We recommend to register early. After the deadline, access to [http://www.starexec.org StarExec] might be restricted. We need time to prepare the competition, and other competitions may be running in parallel.<br />
<br />
It is highly recommended that participants also subscribe to the [http://lists.lri.fr/mailman/listinfo/termtools termtools] mailing list, because that is where announcements will be made, and where discussion takes place.<br />
<br />
== StarExec Information ==<br />
<br />
this refers to StarExec in general, and not to Termination in particular.<br />
<br />
* [https://wiki.uiowa.edu/display/stardev/User+Guide user guide]<br />
* (new in 2019) [https://github.com/StarExec/StarExec/issues issue tracker]<br />
* [https://www.tapatalk.com/groups/starexec/index.php announcements and discussion] ([https://www.tapatalk.com/groups/starexec/app.php/feed combined feed for recent messages])<br />
* (obsolete) [http://starexec.forumotion.com/ announcements and discussion] (discontinued, but contains some information that is still valid and not available elsewhere)<br />
<br />
== Technical Detail ==<br />
<br />
The competition will be running on [http://www.starexec.org/ 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.<br />
<br />
Competition data will be presented via [https://github.com/AkihisaYamada/starexec-master starexec-master]<br />
(a successor of [https://github.com/stefanvonderkrone/star-exec-presenter star-exec-presenter] developed at HTWK Leipzig).<br />
<br />
Technical details about the execution platform (as of 2014) can be found [http://www.termination-portal.org/wiki/Termination_Competition_2014_technical_details here].<br />
<br />
<br />
== Contact ==<br />
<br />
To contact the steering committee of the termination competition, send an email to terminationcompetitionsc<at>lists.rwth-aachen.de. <br />
<br />
The competition organizers can be reached at akihisayamada<at>nii.ac.jp.<br />
<br />
Send new problems for the competition to akihisayamada<at>nii.ac.jp<br />
<br />
== Changes with respect to 2018 ==<br />
<br />
These lists reflect the discussion in the community, and in the steering committee. Items are preliminary, and not officially binding. <br />
Please do not edit this list (unless you're in the SC). Instead, send proposals to termtools or terminationcompetitionsc mailing list,<br />
or create a new wiki page and put a link here.<br />
<br />
<!--<br />
Proposed changes: --><br />
<br />
<!--<br />
Adopted changes: --><br />
<br />
<!--<br />
== TODO ==<br />
<br />
See [[Termination Competition 2016 TODO]]<br />
--></div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=News:Termination_Competition_2019&diff=1816News:Termination Competition 20192018-07-26T17:54:58Z<p>J.waldmann: </p>
<hr />
<div><br />
<!--<br />
Please insert the corresponding information below so that<br />
the news page can be generated automatically.<br />
<br />
Line breaks are allowed! You may use MediaWiki syntax here to link to articles, highlight text, ...<br />
Please add some date to the news entry (e.g. today's date for current news, a time period for the competition, ....).<br />
Example:<br />
|text = The [[WST]] takes place in [http://en.wikipedia.org/wiki/Juneau Juneau] this year!<br />
|date = Sep 8 - Nov 1, 2008<br />
--><br />
<br />
{{News<br />
|text=See [[Termination Competition 2019]]<br />
|date=April 2019<br />
}}</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=News:Workshop_on_Termination_2020&diff=1815News:Workshop on Termination 20202018-07-26T17:54:21Z<p>J.waldmann: Created page with " <!-- Please insert the corresponding information below so that the news page can be generated automatically. Line breaks are allowed! You may use MediaWiki syntax h..."</p>
<hr />
<div><br />
<!--<br />
Please insert the corresponding information below so that<br />
the news page can be generated automatically.<br />
<br />
Line breaks are allowed! You may use MediaWiki syntax here to link to articles, highlight text, ...<br />
Please add some date to the news entry (e.g. today's date for current news, a time period for the competition, ....).<br />
Example:<br />
|text = The [[WST]] takes place in [http://en.wikipedia.org/wiki/Juneau Juneau] this year!<br />
|date = Sep 8 - Nov 1, 2008<br />
--><br />
<br />
{{News<br />
|text=17th Workshop on Termination is planned for June/July 2020 in Paris, see [[WST]].<br />
|date=June 2020<br />
}}</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=News:Termination_Competition_2019&diff=1814News:Termination Competition 20192018-07-26T17:52:35Z<p>J.waldmann: Created page with " <!-- Please insert the corresponding information below so that the news page can be generated automatically. Line breaks are allowed! You may use MediaWiki syntax h..."</p>
<hr />
<div><br />
<!--<br />
Please insert the corresponding information below so that<br />
the news page can be generated automatically.<br />
<br />
Line breaks are allowed! You may use MediaWiki syntax here to link to articles, highlight text, ...<br />
Please add some date to the news entry (e.g. today's date for current news, a time period for the competition, ....).<br />
Example:<br />
|text = The [[WST]] takes place in [http://en.wikipedia.org/wiki/Juneau Juneau] this year!<br />
|date = Sep 8 - Nov 1, 2008<br />
--><br />
<br />
{{News<br />
|text=See [[Termination Competition 2019]]<br />
|date=April 1, 2019<br />
}}</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition_2019&diff=1813Termination Competition 20192018-07-26T17:39:48Z<p>J.waldmann: </p>
<hr />
<div>We intend to be part of [https://tacas.info/toolympics.php Toolympics],<br />
with results presented during TACAS'19, April 16-17, Prague.<br />
<br />
We intend to run on Starexec. The actual run will take<br />
place a few weeks/days before presentation of results,<br />
at the discretion of the organizer, Akihisa Yamada.</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition_2019&diff=1812Termination Competition 20192018-07-26T17:39:30Z<p>J.waldmann: Created page with "We intend to be part of [https://tacas.info/toolympics.php Toolympics], with results presented during TACAS'19, April 16-17, Prague. We intend to run on Starexec, but the act..."</p>
<hr />
<div>We intend to be part of [https://tacas.info/toolympics.php Toolympics],<br />
with results presented during TACAS'19, April 16-17, Prague.<br />
<br />
We intend to run on Starexec, but the actual run will take<br />
place a few weeks/days before presentation of results,<br />
at the discretion of the organizer, Akihisa Yamada.</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition&diff=1811Termination Competition2018-07-26T17:36:41Z<p>J.waldmann: /* Upcoming Competitions */</p>
<hr />
<div>= Annual International Termination Competition =<br />
<br />
During the 90's a number of new, powerful termination methods<br />
was developed. Thus, at the beginning of the millennium<br />
many research groups started to develop [[:Category:Tools | tools for fully-automated termination analysis]].<br />
<br />
After a tool demonstration at the Termination Workshop 2003 (Valencia),<br />
the community then decided to install an annual termination competition, and to collect benchmarks,<br />
to spur the development of tools and new termination techniques.<br />
<br />
From 2004 till 2007, the competition organizer was Claude March&eacute;, [http://www.lri.fr/~marche/termination-competition/ Paris].<br />
From 2008 to 2013 the competition was run by Ren&eacute; Thiemann, [http://termcomp.uibk.ac.at Innsbruck].<br />
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.<br />
From 2018 on, the organizer is Akihisa Yamada. Jobs are run on Star-Exec.<br />
<br />
== Upcoming Competitions ==<br />
<br />
* [[Termination Competition 2019]] is planned to be part of [https://tacas.info/toolympics.php Toolympics], with results presented during TACAS'19, April 16-17, Prague.<br />
<br />
== Competition Categories ==<br />
<br />
Currently, the competition features the following categories:<br />
* termination of [[String Rewriting|string]] and [[Term Rewriting|term rewriting]]<br />
* [[Logic_Programming|termination of logic programs]]<br />
* [[Certified_Termination|certified termination]] of string and term rewriting (since 2007)<br />
* [[Functional_Programming|termination of functional programs]] (since 2007)<br />
* [http://cl-informatik.uibk.ac.at/users/georg/cbr/competition/ complexity of rewrite systems] (since 2008)<br />
* [[Java_Bytecode|termination of Java Bytecode programs]] (since 2009)<br />
* [[Higher_Order|termination of higher order rewriting]] (since 2010)<br />
* [[C_Programs|termination of C programs]] (since 2014)<br />
* termination of [[Transition_Systems|integer transition systems]] (since 2014)<br />
* [[ITRS|integer term rewriting]] (since 2014)<br />
* [[C_Integer_Programs|termination of C integer programs]]<br />
* [[Cycle_Rewriting|termination of cycle rewriting]]<br />
<br />
<br />
Discussion is open and primarily happens on the termtools mailing list.<br />
Decisions will be made by votes among the [[Termination Competition Steering Committee]], with current members<br />
* [http://verify.rwth-aachen.de/giesl/ Jürgen Giesl], RWTH Aachen<br />
* [https://www.cs.upc.edu/~albert/ Albert Rubio] (Chair), UPC Barcelona<br />
* [http://cl-informatik.uibk.ac.at/users/griff/ Christian Sternagel], U. Innsbruck<br />
* [https://www.imn.htwk-leipzig.de/~waldmann/ Johannes Waldmann], HTWK Leipzig<br />
* [http://group-mmm.org/~ayamada/ Akihisa Yamada], NII Tokyo<br />
<br />
== Termination Problems Data Base ==<br />
<br />
The [[TPDB|Termination Problems Data Base]] collects all the problems used in the competitions. <br />
<br />
We welcome problem submissions from non-participants.<br />
<br />
== History of Termination Competitions ==<br />
<br />
The following competitions have taken place:<br />
<br />
* [[Termination Competition 2018]] affiliated with FLoC 2018, Oxford, UK, July 13, 2018<br />
<br />
* [[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]. <br />
<br />
* [[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]<br />
<br />
* [[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]<br />
<br />
* [[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]<br />
<br />
* [[Termination Competition 2013]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=437763 Results], [http://termcomp.uibk.ac.at/2013/competition2013.pdf Report]<br />
<br />
* [[Termination Competition 2012]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=362062 Results], [http://verify.rwth-aachen.de/giesl/competition2012.pdf Report]<br />
<br />
* [[Termination Competition 2011]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=230715 Results], [http://termcomp.uibk.ac.at/2011/competition2011.pdf Report]<br />
<br />
* [[Termination Competition 2010]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=185404 Results] <br />
<br />
* Termination Competition 2009 [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=101722 Results], [http://lists.lri.fr/pipermail/termtools/2009-November/000778.html Announcement]<br />
<br />
* [[Termination_Competition_2008|Termination Competition 2008]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=15991 Results], [http://www.imn.htwk-leipzig.de/~waldmann/talk/09/wst/ Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2007/ Termination Competition 2007], [http://www.imn.htwk-leipzig.de/~waldmann/talk/07/wst/competition/ Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2006/ Termination Competition 2006], [http://www.lri.fr/~marche/termination-competition/2006/reportCompetition2006.pdf Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2005/ Termination Competition 2005], [http://www.lri.fr/~marche/termination-competition/2005/TC.ppt Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2004/ Termination Competition 2004], [http://www.lri.fr/~marche/termination-competition/2004/slides-1jun2004.ps Report]<br />
<br />
At the "tool demonstration" in 2003, participating provers (including AProVe, Torpa, Matchbox)<br />
were run on the laptop computers of their developers in the room. Termination problems were announced <br />
on the spot by participants, then written on the blackboard, then typed in by everyone, and when a team's program<br />
could solve it, they shouted "solved".<br />
<br />
== Static Backups of Results ==<br />
<br />
For many previous competitions, static backups of the results are availble [https://aprove-developers.github.io/termcomp_results/ here].</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition&diff=1810Termination Competition2018-07-26T17:36:23Z<p>J.waldmann: /* Annual International Termination Competition */</p>
<hr />
<div>= Annual International Termination Competition =<br />
<br />
During the 90's a number of new, powerful termination methods<br />
was developed. Thus, at the beginning of the millennium<br />
many research groups started to develop [[:Category:Tools | tools for fully-automated termination analysis]].<br />
<br />
After a tool demonstration at the Termination Workshop 2003 (Valencia),<br />
the community then decided to install an annual termination competition, and to collect benchmarks,<br />
to spur the development of tools and new termination techniques.<br />
<br />
From 2004 till 2007, the competition organizer was Claude March&eacute;, [http://www.lri.fr/~marche/termination-competition/ Paris].<br />
From 2008 to 2013 the competition was run by Ren&eacute; Thiemann, [http://termcomp.uibk.ac.at Innsbruck].<br />
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.<br />
From 2018 on, the organizer is Akihisa Yamada. Jobs are run on Star-Exec.<br />
<br />
== Upcoming Competitions ==<br />
<br />
* [[Termination Competition 2019]] is planned to be part of [https://tacas.info/toolympics.php Toolympics],<br />
with results presented during TACAS'19, April 16-17, Prague.<br />
<br />
== Competition Categories ==<br />
<br />
Currently, the competition features the following categories:<br />
* termination of [[String Rewriting|string]] and [[Term Rewriting|term rewriting]]<br />
* [[Logic_Programming|termination of logic programs]]<br />
* [[Certified_Termination|certified termination]] of string and term rewriting (since 2007)<br />
* [[Functional_Programming|termination of functional programs]] (since 2007)<br />
* [http://cl-informatik.uibk.ac.at/users/georg/cbr/competition/ complexity of rewrite systems] (since 2008)<br />
* [[Java_Bytecode|termination of Java Bytecode programs]] (since 2009)<br />
* [[Higher_Order|termination of higher order rewriting]] (since 2010)<br />
* [[C_Programs|termination of C programs]] (since 2014)<br />
* termination of [[Transition_Systems|integer transition systems]] (since 2014)<br />
* [[ITRS|integer term rewriting]] (since 2014)<br />
* [[C_Integer_Programs|termination of C integer programs]]<br />
* [[Cycle_Rewriting|termination of cycle rewriting]]<br />
<br />
<br />
Discussion is open and primarily happens on the termtools mailing list.<br />
Decisions will be made by votes among the [[Termination Competition Steering Committee]], with current members<br />
* [http://verify.rwth-aachen.de/giesl/ Jürgen Giesl], RWTH Aachen<br />
* [https://www.cs.upc.edu/~albert/ Albert Rubio] (Chair), UPC Barcelona<br />
* [http://cl-informatik.uibk.ac.at/users/griff/ Christian Sternagel], U. Innsbruck<br />
* [https://www.imn.htwk-leipzig.de/~waldmann/ Johannes Waldmann], HTWK Leipzig<br />
* [http://group-mmm.org/~ayamada/ Akihisa Yamada], NII Tokyo<br />
<br />
== Termination Problems Data Base ==<br />
<br />
The [[TPDB|Termination Problems Data Base]] collects all the problems used in the competitions. <br />
<br />
We welcome problem submissions from non-participants.<br />
<br />
== History of Termination Competitions ==<br />
<br />
The following competitions have taken place:<br />
<br />
* [[Termination Competition 2018]] affiliated with FLoC 2018, Oxford, UK, July 13, 2018<br />
<br />
* [[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]. <br />
<br />
* [[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]<br />
<br />
* [[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]<br />
<br />
* [[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]<br />
<br />
* [[Termination Competition 2013]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=437763 Results], [http://termcomp.uibk.ac.at/2013/competition2013.pdf Report]<br />
<br />
* [[Termination Competition 2012]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=362062 Results], [http://verify.rwth-aachen.de/giesl/competition2012.pdf Report]<br />
<br />
* [[Termination Competition 2011]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=230715 Results], [http://termcomp.uibk.ac.at/2011/competition2011.pdf Report]<br />
<br />
* [[Termination Competition 2010]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=185404 Results] <br />
<br />
* Termination Competition 2009 [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=101722 Results], [http://lists.lri.fr/pipermail/termtools/2009-November/000778.html Announcement]<br />
<br />
* [[Termination_Competition_2008|Termination Competition 2008]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=15991 Results], [http://www.imn.htwk-leipzig.de/~waldmann/talk/09/wst/ Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2007/ Termination Competition 2007], [http://www.imn.htwk-leipzig.de/~waldmann/talk/07/wst/competition/ Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2006/ Termination Competition 2006], [http://www.lri.fr/~marche/termination-competition/2006/reportCompetition2006.pdf Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2005/ Termination Competition 2005], [http://www.lri.fr/~marche/termination-competition/2005/TC.ppt Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2004/ Termination Competition 2004], [http://www.lri.fr/~marche/termination-competition/2004/slides-1jun2004.ps Report]<br />
<br />
At the "tool demonstration" in 2003, participating provers (including AProVe, Torpa, Matchbox)<br />
were run on the laptop computers of their developers in the room. Termination problems were announced <br />
on the spot by participants, then written on the blackboard, then typed in by everyone, and when a team's program<br />
could solve it, they shouted "solved".<br />
<br />
== Static Backups of Results ==<br />
<br />
For many previous competitions, static backups of the results are availble [https://aprove-developers.github.io/termcomp_results/ here].</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition&diff=1809Termination Competition2018-07-26T17:15:33Z<p>J.waldmann: </p>
<hr />
<div>= Annual International Termination Competition =<br />
<br />
During the 90's a number of new, powerful termination methods<br />
was developed. Thus, at the beginning of the millennium<br />
many research groups started to develop [[:Category:Tools | tools for fully-automated termination analysis]].<br />
<br />
After a tool demonstration at the 2003 [[WST|Workshop on Termination]] in Valencia,<br />
the community decided to install an annual termination competition<br />
to spur the development of tools and new termination techniques.<br />
<br />
From 2004 till 2007, the competition organizer was Claude March&eacute;, [http://www.lri.fr/~marche/termination-competition/ Paris].<br />
From 2008 to 2013 the competition was run by Ren&eacute; Thiemann, [http://termcomp.uibk.ac.at Innsbruck].<br />
Since 2014, the competition organizer is Johannes Waldmann. Jobs are run on the [https://www.starexec.org/ Star Exec] platform at U Iowa. Results are aggregated and displayed at [http://nfa.imn.htwk-leipzig.de/termcomp/competition/20 HTWK Leipzig].<br />
<br />
== Upcoming Competitions ==<br />
<br />
<br />
== Competition Categories ==<br />
<br />
Currently, the competition features the following categories:<br />
* termination of [[String Rewriting|string]] and [[Term Rewriting|term rewriting]]<br />
* [[Logic_Programming|termination of logic programs]]<br />
* [[Certified_Termination|certified termination]] of string and term rewriting (since 2007)<br />
* [[Functional_Programming|termination of functional programs]] (since 2007)<br />
* [http://cl-informatik.uibk.ac.at/users/georg/cbr/competition/ complexity of rewrite systems] (since 2008)<br />
* [[Java_Bytecode|termination of Java Bytecode programs]] (since 2009)<br />
* [[Higher_Order|termination of higher order rewriting]] (since 2010)<br />
* [[C_Programs|termination of C programs]] (since 2014)<br />
* termination of [[Transition_Systems|integer transition systems]] (since 2014)<br />
* [[ITRS|integer term rewriting]] (since 2014)<br />
* [[C_Integer_Programs|termination of C integer programs]]<br />
* [[Cycle_Rewriting|termination of cycle rewriting]]<br />
<br />
<br />
Discussion is open and primarily happens on the termtools mailing list.<br />
Decisions will be made by votes among the [[Termination Competition Steering Committee]], with current members<br />
* [http://verify.rwth-aachen.de/giesl/ Jürgen Giesl], RWTH Aachen<br />
* [https://www.cs.upc.edu/~albert/ Albert Rubio] (Chair), UPC Barcelona<br />
* [http://cl-informatik.uibk.ac.at/users/griff/ Christian Sternagel], U. Innsbruck<br />
* [https://www.imn.htwk-leipzig.de/~waldmann/ Johannes Waldmann], HTWK Leipzig<br />
* [http://group-mmm.org/~ayamada/ Akihisa Yamada], NII Tokyo<br />
<br />
== Termination Problems Data Base ==<br />
<br />
The [[TPDB|Termination Problems Data Base]] collects all the problems used in the competitions. <br />
<br />
We welcome problem submissions from non-participants.<br />
<br />
== History of Termination Competitions ==<br />
<br />
The following competitions have taken place:<br />
<br />
* [[Termination Competition 2018]] affiliated with FLoC 2018, Oxford, UK, July 13, 2018<br />
<br />
* [[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]. <br />
<br />
* [[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]<br />
<br />
* [[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]<br />
<br />
* [[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]<br />
<br />
* [[Termination Competition 2013]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=437763 Results], [http://termcomp.uibk.ac.at/2013/competition2013.pdf Report]<br />
<br />
* [[Termination Competition 2012]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=362062 Results], [http://verify.rwth-aachen.de/giesl/competition2012.pdf Report]<br />
<br />
* [[Termination Competition 2011]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=230715 Results], [http://termcomp.uibk.ac.at/2011/competition2011.pdf Report]<br />
<br />
* [[Termination Competition 2010]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=185404 Results] <br />
<br />
* Termination Competition 2009 [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=101722 Results], [http://lists.lri.fr/pipermail/termtools/2009-November/000778.html Announcement]<br />
<br />
* [[Termination_Competition_2008|Termination Competition 2008]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=15991 Results], [http://www.imn.htwk-leipzig.de/~waldmann/talk/09/wst/ Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2007/ Termination Competition 2007], [http://www.imn.htwk-leipzig.de/~waldmann/talk/07/wst/competition/ Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2006/ Termination Competition 2006], [http://www.lri.fr/~marche/termination-competition/2006/reportCompetition2006.pdf Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2005/ Termination Competition 2005], [http://www.lri.fr/~marche/termination-competition/2005/TC.ppt Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2004/ Termination Competition 2004], [http://www.lri.fr/~marche/termination-competition/2004/slides-1jun2004.ps Report]<br />
<br />
== Static Backups of Results ==<br />
<br />
For many previous competitions, static backups of the results are availble [https://aprove-developers.github.io/termcomp_results/ here].</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=WST&diff=1808WST2018-07-26T17:12:40Z<p>J.waldmann: </p>
<hr />
<div>The International Workshop on Termination (WST) brings together, in an informal setting, researchers interested in all aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop also provides a ground for cross-fertilisation of ideas from term rewriting and from the different programming language communities.<br />
<br />
Upcoming events:<br />
<br />
* [http://costa.fdi.ucm.es/wst2020/ 17th International Workshop on Termination] planned to be co-located with IJCAR and [http://fscdconference.org/editions/upcoming FSCD 2020], Paris (France), June/July, 2020. <br />
<br />
Previous workshops:<br />
* [http://wst2018.webs.upv.es/ 16th International Workshop on Termination] during [http://www.floc2018.org/ Federated Logic Conference (FLoC)], Oxford, United Kingdom, July 18-19, 2018.<br />
* [http://cl-informatik.uibk.ac.at/events/wst-2016/ 15th International Workshop on Termination] at [http://cl-informatik.uibk.ac.at/events/cla-2016/ Computational Logic in the Alps], Obergurgl, Austria, September 5-7, 2016.<br />
* [https://easychair.org/smart-program/VSL2014/WST-index.html 14th International Workshop on Termination] during [http://vsl2014.at/ Vienna Summer of Logic], Vienna, Austria, July 17-18, 2014.<br />
* Joint Workshop on Termination [http://www.imn.htwk-leipzig.de/WST2013/ WST2013] and on Foundational and Practical Aspects of Resource Analysis [http://fopara2013.cs.unibo.it/ FOPARA], Bertinoro, Italy, August 29-31, 2013.<br />
* [http://cl-informatik.uibk.ac.at/users/georg/events/wst2012 12th International Workshop on Termination, Obergurgl, February 19-23, 2012].<br />
* [http://imada.sdu.dk/~petersk/WST2010/ 11th International Workshop on Termination, Edinburgh, 2010].<br />
* [https://portal.imn.htwk-leipzig.de/termine/10-international-workshop-on-termination/ 10th International Workshop on Termination, Leipzig, 2009].<br />
* [http://www.lsv.ens-cachan.fr/rdp07/wst.html 9th International Workshop on Termination, Paris, 2007].<br />
* [http://www.easychair.org/FLoC-06/WST.html 8th International Workshop on Termination, Seattle, 2006].<br />
* [http://www-i2.informatik.rwth-aachen.de/WST04/ 7th International Workshop on Termination, Aachen, 2004].<br />
* [http://www.dsic.upv.es/~rdp03/wst/ 6th International Workshop on Termination, Valencia, 2003].<br />
* [http://www.cs.tau.ac.il/~nachumd/wst/index.html 5th International Workshop on Termination, Utrecht, 2001].<br />
* [http://verify.rwth-aachen.de/giesl/WST99.html 4th International Workshop on Termination, Dagstuhl, 1999].<br />
* [http://www-i2.informatik.rwth-aachen.de/giesl/WST97/main.html 3rd International Workshop on Termination, Ede, 1997].<br />
* 2nd International Workshop on Termination, La Bresse, 1995.<br />
* 1st International Workshop on Termination, St. Andrews, 1993.<br />
<br />
Independently from WST, there are meetings on Certified Termination : [[WScT]]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=WST&diff=1807WST2018-07-26T17:11:21Z<p>J.waldmann: </p>
<hr />
<div>The International Workshop on Termination (WST) brings together, in an informal setting, researchers interested in all aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop also provides a ground for cross-fertilisation of ideas from term rewriting and from the different programming language communities.<br />
<br />
Upcoming events:<br />
<br />
* [http://costa.fdi.ucm.es/wst2020/ 17th International Workshop on Termination] planned to be co-located with IJCAR and FSCD 2020, Paris (France), June/July, 2020. <br />
<br />
<br />
Previous workshops:<br />
* [http://wst2018.webs.upv.es/ 16th International Workshop on Termination] during [http://www.floc2018.org/ Federated Logic Conference (FLoC)], Oxford, United Kingdom, July 18-19, 2018.<br />
* [http://cl-informatik.uibk.ac.at/events/wst-2016/ 15th International Workshop on Termination] at [http://cl-informatik.uibk.ac.at/events/cla-2016/ Computational Logic in the Alps], Obergurgl, Austria, September 5-7, 2016.<br />
* [https://easychair.org/smart-program/VSL2014/WST-index.html 14th International Workshop on Termination] during [http://vsl2014.at/ Vienna Summer of Logic], Vienna, Austria, July 17-18, 2014.<br />
* Joint Workshop on Termination [http://www.imn.htwk-leipzig.de/WST2013/ WST2013] and on Foundational and Practical Aspects of Resource Analysis [http://fopara2013.cs.unibo.it/ FOPARA], Bertinoro, Italy, August 29-31, 2013.<br />
* [http://cl-informatik.uibk.ac.at/users/georg/events/wst2012 12th International Workshop on Termination, Obergurgl, February 19-23, 2012].<br />
* [http://imada.sdu.dk/~petersk/WST2010/ 11th International Workshop on Termination, Edinburgh, 2010].<br />
* [https://portal.imn.htwk-leipzig.de/termine/10-international-workshop-on-termination/ 10th International Workshop on Termination, Leipzig, 2009].<br />
* [http://www.lsv.ens-cachan.fr/rdp07/wst.html 9th International Workshop on Termination, Paris, 2007].<br />
* [http://www.easychair.org/FLoC-06/WST.html 8th International Workshop on Termination, Seattle, 2006].<br />
* [http://www-i2.informatik.rwth-aachen.de/WST04/ 7th International Workshop on Termination, Aachen, 2004].<br />
* [http://www.dsic.upv.es/~rdp03/wst/ 6th International Workshop on Termination, Valencia, 2003].<br />
* [http://www.cs.tau.ac.il/~nachumd/wst/index.html 5th International Workshop on Termination, Utrecht, 2001].<br />
* [http://verify.rwth-aachen.de/giesl/WST99.html 4th International Workshop on Termination, Dagstuhl, 1999].<br />
* [http://www-i2.informatik.rwth-aachen.de/giesl/WST97/main.html 3rd International Workshop on Termination, Ede, 1997].<br />
* 2nd International Workshop on Termination, La Bresse, 1995.<br />
* 1st International Workshop on Termination, St. Andrews, 1993.<br />
<br />
Independently from WST, there are meetings on Certified Termination : [[WScT]]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=TPDB&diff=1806TPDB2018-07-16T12:44:51Z<p>J.waldmann: /* Sources */</p>
<hr />
<div>The Termination Problems Data Base collects termination problems<br />
that are being used in termination competitions.<br />
<br />
== Syntax and semantics specification ==<br />
<br />
<br />
* for versions from 7.* onwards (XML format): [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB/raw-file/tip/xml/xtc.xsd xtc.xsd], already part of the [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB TPDB]<br />
* for versions up to 5.*: http://www.lri.fr/~marche/tpdb/format.html<br />
<br />
see also:<br />
<br />
* output specification for certified categories: http://cl-informatik.uibk.ac.at/software/cpf/<br />
<br />
== Data ==<br />
* version 9.0 (2014), 10.3 (2015), 10.4 (2016), 10.5 (2017), 10.6 (2018) http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB<br />
* version 7.* (2009), 8.0 (2010), 8.0.1 (2011), 8.0.6 (2012) and 8.0.7 (2013) http://termcomp.uibk.ac.at/status/downloads/<br />
* version 6.0.2 http://termcomp.uibk.ac.at/termcomp/docs/tpdb-6.0.2.tar.gz<br />
* version 5.0.2 (2008..2009) http://termcomp.uibk.ac.at/termcomp/docs/tpdb-5.0.2.tar.gz<br />
* earlier versions (2003 .. 2007) http://www.lri.fr/~marche/tpdb/<br />
<br />
== Sources ==<br />
<br />
TPDB problems are collected from a variety of sources, by a variety of contributors. Often, the author of the problem is not the creator of the respective TPDB file. Sometimes, TPDB file structure (directory names) have been changed.<br />
<br />
The following are references for classical problem sets that appear in TPDB. <br />
<br />
* TRS/SK90 Joachim Steinbach, Ulrich Kühler: Check your Ordering - termination proofs and open Problems, Technical Report SR-90-25, Universität Kaiserslautern, 1990.<br />
* TRS/D33 Nachum Dershowitz: 33 Examples of Termination, 1995 Proc. French Spring School of Theoretical Computer Science, LNCS 909, http://www.math.tau.ac.il/~nachumd/papers/printemp-print.pdf<br />
* TRS/AG01 Thomas Arts, Jürgen Giesl: Termination of term rewriting using dependency pairs, 2000, http://dblp.uni-trier.de/rec/bibtex/journals/tcs/ArtsG00 http://verify.rwth-aachen.de/giesl/papers/ibn-97-46.ps<br />
* SRS/Zantema 128 string rewriting termination problems collected by Hans Zantema (2004?). They include (as z027 .. z064) a set of one-rule termination problems by Alfons Geser (Habilitationsschrift, Tübingen, 2001) and possibly Winfried Kurth (Dissertation, Clausthal, 1990)<br />
<br />
And here are some extra bits of trivia.<br />
<br />
* SRS termination problems ICFP_2010 and ICFP_2010_relative were produced by participants of the ICFP 2010 programming contest, organized by Bertram Felgenhauer and Johannes Waldmann. ''All'' of these problems are terminating by construction. See https://www.imn.htwk-leipzig.de/~waldmann/talk/10/icfp/<br />
<br />
== Tools ==<br />
* converter from pre-7 (textual) format to 7.* (XML) format: http://cl-informatik.uibk.ac.at/users/thiemann/convert.jar, usage:<br />
<br />
java -jar convert.jar someTrs.trs > someTrs.xml <br />
<br />
* converter from 7.* (XML) format to pre-7 (textual) format: [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB/raw-file/tip/xml/xtc2tpdb.xsl xtc2tpdb.xsl], already part of the [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB TPDB], usage:<br />
<br />
xsltproc xtc2tpdb.xsl someTrs.xml > someTrs.trs<br />
<br />
* converter from 7.* (XML) format to HTML: [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB/raw-file/tip/xml/xtcHTML.xsl xtcHTML.xsl], see explanation at http://lists.lri.fr/pipermail/termtools/2018-July/001212.html<br />
<br />
* Haskell library for reading and writing TPDB (plain and XML format) [http://hackage.haskell.org/package/tpdb]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=TPDB&diff=1805TPDB2018-07-16T10:15:51Z<p>J.waldmann: /* Tools */</p>
<hr />
<div>The Termination Problems Data Base collects termination problems<br />
that are being used in termination competitions.<br />
<br />
== Syntax and semantics specification ==<br />
<br />
<br />
* for versions from 7.* onwards (XML format): [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB/raw-file/tip/xml/xtc.xsd xtc.xsd], already part of the [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB TPDB]<br />
* for versions up to 5.*: http://www.lri.fr/~marche/tpdb/format.html<br />
<br />
see also:<br />
<br />
* output specification for certified categories: http://cl-informatik.uibk.ac.at/software/cpf/<br />
<br />
== Data ==<br />
* version 9.0 (2014), 10.3 (2015), 10.4 (2016), 10.5 (2017), 10.6 (2018) http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB<br />
* version 7.* (2009), 8.0 (2010), 8.0.1 (2011), 8.0.6 (2012) and 8.0.7 (2013) http://termcomp.uibk.ac.at/status/downloads/<br />
* version 6.0.2 http://termcomp.uibk.ac.at/termcomp/docs/tpdb-6.0.2.tar.gz<br />
* version 5.0.2 (2008..2009) http://termcomp.uibk.ac.at/termcomp/docs/tpdb-5.0.2.tar.gz<br />
* earlier versions (2003 .. 2007) http://www.lri.fr/~marche/tpdb/<br />
<br />
== Sources ==<br />
<br />
TPDB problems are collected from a variety of sources, by a variety of contributors. Often, the author of the problem is not the creator of the respective TPDB file. Sometimes, TPDB file structure (directory names) have been changed.<br />
<br />
The following are references for classical problem sets that appear in TPDB. <br />
<br />
* TRS/SK90 Joachim Steinbach, Ulrich Kühler: Check your Ordering - termination proofs and open Problems, Technical Report SR-90-25, Universität Kaiserslautern, 1990.<br />
* TRS/D33 Nachum Dershowitz: 33 Examples of Termination, 1995 Proc. French Spring School of Theoretical Computer Science, LNCS 909, http://www.math.tau.ac.il/~nachumd/papers/printemp-print.pdf<br />
* TRS/AG01 Thomas Arts, Jürgen Giesl: Termination of term rewriting using dependency pairs, 2000, http://dblp.uni-trier.de/rec/bibtex/journals/tcs/ArtsG00 http://verify.rwth-aachen.de/giesl/papers/ibn-97-46.ps<br />
* SRS/Zantema 128 string rewriting termination problems collected by Hans Zantema (2004?). They include (as z027 .. z064) a set of one-rule termination problems by Alfons Geser (Habilitationsschrift, Tübingen, 2001) and possibly Winfried Kurth (Dissertation, Clausthal, 1990)<br />
<br />
And here are some extra bits of trivia.<br />
<br />
* SRS termination problems ICFP_2010 and ICFP_2010_relative were produced by participants of the ICFP 2010 programming contest, organized by Bertragm Felgenhauer and Johannes Waldmann. ''All'' of these problems are terminating by construction. See https://www.imn.htwk-leipzig.de/~waldmann/talk/10/icfp/<br />
<br />
== Tools ==<br />
* converter from pre-7 (textual) format to 7.* (XML) format: http://cl-informatik.uibk.ac.at/users/thiemann/convert.jar, usage:<br />
<br />
java -jar convert.jar someTrs.trs > someTrs.xml <br />
<br />
* converter from 7.* (XML) format to pre-7 (textual) format: [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB/raw-file/tip/xml/xtc2tpdb.xsl xtc2tpdb.xsl], already part of the [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB TPDB], usage:<br />
<br />
xsltproc xtc2tpdb.xsl someTrs.xml > someTrs.trs<br />
<br />
* converter from 7.* (XML) format to HTML: [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB/raw-file/tip/xml/xtcHTML.xsl xtcHTML.xsl], see explanation at http://lists.lri.fr/pipermail/termtools/2018-July/001212.html<br />
<br />
* Haskell library for reading and writing TPDB (plain and XML format) [http://hackage.haskell.org/package/tpdb]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=TPDB&diff=1804TPDB2018-07-15T18:14:10Z<p>J.waldmann: /* Sources */</p>
<hr />
<div>The Termination Problems Data Base collects termination problems<br />
that are being used in termination competitions.<br />
<br />
== Syntax and semantics specification ==<br />
<br />
<br />
* for versions from 7.* onwards (XML format): [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB/raw-file/tip/xml/xtc.xsd xtc.xsd], already part of the [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB TPDB]<br />
* for versions up to 5.*: http://www.lri.fr/~marche/tpdb/format.html<br />
<br />
see also:<br />
<br />
* output specification for certified categories: http://cl-informatik.uibk.ac.at/software/cpf/<br />
<br />
== Data ==<br />
* version 9.0 (2014), 10.3 (2015), 10.4 (2016), 10.5 (2017), 10.6 (2018) http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB<br />
* version 7.* (2009), 8.0 (2010), 8.0.1 (2011), 8.0.6 (2012) and 8.0.7 (2013) http://termcomp.uibk.ac.at/status/downloads/<br />
* version 6.0.2 http://termcomp.uibk.ac.at/termcomp/docs/tpdb-6.0.2.tar.gz<br />
* version 5.0.2 (2008..2009) http://termcomp.uibk.ac.at/termcomp/docs/tpdb-5.0.2.tar.gz<br />
* earlier versions (2003 .. 2007) http://www.lri.fr/~marche/tpdb/<br />
<br />
== Sources ==<br />
<br />
TPDB problems are collected from a variety of sources, by a variety of contributors. Often, the author of the problem is not the creator of the respective TPDB file. Sometimes, TPDB file structure (directory names) have been changed.<br />
<br />
The following are references for classical problem sets that appear in TPDB. <br />
<br />
* TRS/SK90 Joachim Steinbach, Ulrich Kühler: Check your Ordering - termination proofs and open Problems, Technical Report SR-90-25, Universität Kaiserslautern, 1990.<br />
* TRS/D33 Nachum Dershowitz: 33 Examples of Termination, 1995 Proc. French Spring School of Theoretical Computer Science, LNCS 909, http://www.math.tau.ac.il/~nachumd/papers/printemp-print.pdf<br />
* TRS/AG01 Thomas Arts, Jürgen Giesl: Termination of term rewriting using dependency pairs, 2000, http://dblp.uni-trier.de/rec/bibtex/journals/tcs/ArtsG00 http://verify.rwth-aachen.de/giesl/papers/ibn-97-46.ps<br />
* SRS/Zantema 128 string rewriting termination problems collected by Hans Zantema (2004?). They include (as z027 .. z064) a set of one-rule termination problems by Alfons Geser (Habilitationsschrift, Tübingen, 2001) and possibly Winfried Kurth (Dissertation, Clausthal, 1990)<br />
<br />
And here are some extra bits of trivia.<br />
<br />
* SRS termination problems ICFP_2010 and ICFP_2010_relative were produced by participants of the ICFP 2010 programming contest, organized by Bertragm Felgenhauer and Johannes Waldmann. ''All'' of these problems are terminating by construction. See https://www.imn.htwk-leipzig.de/~waldmann/talk/10/icfp/<br />
<br />
== Tools ==<br />
* converter from pre-7 (textual) format to 7.* (XML) format: http://cl-informatik.uibk.ac.at/users/thiemann/convert.jar, usage:<br />
<br />
java -jar convert.jar someTrs.trs > someTrs.xml <br />
<br />
* converter from 7.* (XML) format to pre-7 (textual) format: [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB/raw-file/tip/xml/xtc2tpdb.xsl xtc2tpdb.xsl], already part of the [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB TPDB], usage:<br />
<br />
xsltproc xtc2tpdb.xsl someTrs.xml > someTrs.trs<br />
<br />
* Haskell library for reading and writing TPDB (plain and XML format) [http://hackage.haskell.org/package/tpdb]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=TPDB&diff=1803TPDB2018-07-15T18:06:07Z<p>J.waldmann: /* Data */</p>
<hr />
<div>The Termination Problems Data Base collects termination problems<br />
that are being used in termination competitions.<br />
<br />
== Syntax and semantics specification ==<br />
<br />
<br />
* for versions from 7.* onwards (XML format): [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB/raw-file/tip/xml/xtc.xsd xtc.xsd], already part of the [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB TPDB]<br />
* for versions up to 5.*: http://www.lri.fr/~marche/tpdb/format.html<br />
<br />
see also:<br />
<br />
* output specification for certified categories: http://cl-informatik.uibk.ac.at/software/cpf/<br />
<br />
== Data ==<br />
* version 9.0 (2014), 10.3 (2015), 10.4 (2016), 10.5 (2017), 10.6 (2018) http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB<br />
* version 7.* (2009), 8.0 (2010), 8.0.1 (2011), 8.0.6 (2012) and 8.0.7 (2013) http://termcomp.uibk.ac.at/status/downloads/<br />
* version 6.0.2 http://termcomp.uibk.ac.at/termcomp/docs/tpdb-6.0.2.tar.gz<br />
* version 5.0.2 (2008..2009) http://termcomp.uibk.ac.at/termcomp/docs/tpdb-5.0.2.tar.gz<br />
* earlier versions (2003 .. 2007) http://www.lri.fr/~marche/tpdb/<br />
<br />
== Sources ==<br />
<br />
TPDB problems are collected from a variety of sources, by a variety of contributors. Often, the author of the problem is not the creator of the respective TPDB file. Sometimes, TPDB file structure (directory names) have been changed.<br />
<br />
The following are references for classical problem sets that appear in TPDB. <br />
<br />
* TRS/SK90 Joachim Steinbach, Ulrich Kühler: Check your Ordering - termination proofs and open Problems, Technical Report SR-90-25, Universität Kaiserslautern, 1990.<br />
* TRS/D33 Nachum Dershowitz: 33 Examples of Termination, 1995 Proc. French Spring School of Theoretical Computer Science, LNCS 909, http://www.math.tau.ac.il/~nachumd/papers/printemp-print.pdf<br />
* TRS/AG01 Thomas Arts, Jürgen Giesl: Termination of term rewriting using dependency pairs, 2000, http://dblp.uni-trier.de/rec/bibtex/journals/tcs/ArtsG00 http://verify.rwth-aachen.de/giesl/papers/ibn-97-46.ps<br />
* SRS/Zantema 128 string rewriting termination problems collected by Hans Zantema (2004?)<br />
<br />
And here are some extra bits of trivia.<br />
<br />
* SRS termination problems ICFP_2010 and ICFP_2010_relative were produced by participants of the ICFP 2010 programming contest, organized by Bertragm Felgenhauer and Johannes Waldmann. ''All'' of these problems are terminating by construction. See https://www.imn.htwk-leipzig.de/~waldmann/talk/10/icfp/<br />
<br />
== Tools ==<br />
* converter from pre-7 (textual) format to 7.* (XML) format: http://cl-informatik.uibk.ac.at/users/thiemann/convert.jar, usage:<br />
<br />
java -jar convert.jar someTrs.trs > someTrs.xml <br />
<br />
* converter from 7.* (XML) format to pre-7 (textual) format: [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB/raw-file/tip/xml/xtc2tpdb.xsl xtc2tpdb.xsl], already part of the [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB TPDB], usage:<br />
<br />
xsltproc xtc2tpdb.xsl someTrs.xml > someTrs.trs<br />
<br />
* Haskell library for reading and writing TPDB (plain and XML format) [http://hackage.haskell.org/package/tpdb]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=TPDB&diff=1802TPDB2018-07-15T18:05:04Z<p>J.waldmann: /* Sources */</p>
<hr />
<div>The Termination Problems Data Base collects termination problems<br />
that are being used in termination competitions.<br />
<br />
== Syntax and semantics specification ==<br />
<br />
<br />
* for versions from 7.* onwards (XML format): [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB/raw-file/tip/xml/xtc.xsd xtc.xsd], already part of the [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB TPDB]<br />
* for versions up to 5.*: http://www.lri.fr/~marche/tpdb/format.html<br />
<br />
see also:<br />
<br />
* output specification for certified categories: http://cl-informatik.uibk.ac.at/software/cpf/<br />
<br />
== Data ==<br />
* version 9.0 (2014), 10.3 (2015) http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB<br />
* version 7.* (2009), 8.0 (2010), 8.0.1 (2011), 8.0.6 (2012) and 8.0.7 (2013) http://termcomp.uibk.ac.at/status/downloads/<br />
* version 6.0.2 http://termcomp.uibk.ac.at/termcomp/docs/tpdb-6.0.2.tar.gz<br />
* version 5.0.2 (2008..2009) http://termcomp.uibk.ac.at/termcomp/docs/tpdb-5.0.2.tar.gz<br />
* earlier versions (2003 .. 2007) http://www.lri.fr/~marche/tpdb/<br />
<br />
== Sources ==<br />
<br />
TPDB problems are collected from a variety of sources, by a variety of contributors. Often, the author of the problem is not the creator of the respective TPDB file. Sometimes, TPDB file structure (directory names) have been changed.<br />
<br />
The following are references for classical problem sets that appear in TPDB. <br />
<br />
* TRS/SK90 Joachim Steinbach, Ulrich Kühler: Check your Ordering - termination proofs and open Problems, Technical Report SR-90-25, Universität Kaiserslautern, 1990.<br />
* TRS/D33 Nachum Dershowitz: 33 Examples of Termination, 1995 Proc. French Spring School of Theoretical Computer Science, LNCS 909, http://www.math.tau.ac.il/~nachumd/papers/printemp-print.pdf<br />
* TRS/AG01 Thomas Arts, Jürgen Giesl: Termination of term rewriting using dependency pairs, 2000, http://dblp.uni-trier.de/rec/bibtex/journals/tcs/ArtsG00 http://verify.rwth-aachen.de/giesl/papers/ibn-97-46.ps<br />
* SRS/Zantema 128 string rewriting termination problems collected by Hans Zantema (2004?)<br />
<br />
And here are some extra bits of trivia.<br />
<br />
* SRS termination problems ICFP_2010 and ICFP_2010_relative were produced by participants of the ICFP 2010 programming contest, organized by Bertragm Felgenhauer and Johannes Waldmann. ''All'' of these problems are terminating by construction. See https://www.imn.htwk-leipzig.de/~waldmann/talk/10/icfp/<br />
<br />
== Tools ==<br />
* converter from pre-7 (textual) format to 7.* (XML) format: http://cl-informatik.uibk.ac.at/users/thiemann/convert.jar, usage:<br />
<br />
java -jar convert.jar someTrs.trs > someTrs.xml <br />
<br />
* converter from 7.* (XML) format to pre-7 (textual) format: [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB/raw-file/tip/xml/xtc2tpdb.xsl xtc2tpdb.xsl], already part of the [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB TPDB], usage:<br />
<br />
xsltproc xtc2tpdb.xsl someTrs.xml > someTrs.trs<br />
<br />
* Haskell library for reading and writing TPDB (plain and XML format) [http://hackage.haskell.org/package/tpdb]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=TPDB&diff=1801TPDB2018-07-15T18:04:16Z<p>J.waldmann: /* Sources */</p>
<hr />
<div>The Termination Problems Data Base collects termination problems<br />
that are being used in termination competitions.<br />
<br />
== Syntax and semantics specification ==<br />
<br />
<br />
* for versions from 7.* onwards (XML format): [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB/raw-file/tip/xml/xtc.xsd xtc.xsd], already part of the [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB TPDB]<br />
* for versions up to 5.*: http://www.lri.fr/~marche/tpdb/format.html<br />
<br />
see also:<br />
<br />
* output specification for certified categories: http://cl-informatik.uibk.ac.at/software/cpf/<br />
<br />
== Data ==<br />
* version 9.0 (2014), 10.3 (2015) http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB<br />
* version 7.* (2009), 8.0 (2010), 8.0.1 (2011), 8.0.6 (2012) and 8.0.7 (2013) http://termcomp.uibk.ac.at/status/downloads/<br />
* version 6.0.2 http://termcomp.uibk.ac.at/termcomp/docs/tpdb-6.0.2.tar.gz<br />
* version 5.0.2 (2008..2009) http://termcomp.uibk.ac.at/termcomp/docs/tpdb-5.0.2.tar.gz<br />
* earlier versions (2003 .. 2007) http://www.lri.fr/~marche/tpdb/<br />
<br />
== Sources ==<br />
<br />
The following are references for classical problem sets that appear in TPDB. <br />
<br />
* TRS/SK90 Joachim Steinbach, Ulrich Kühler: Check your Ordering - termination proofs and open Problems, Technical Report SR-90-25, Universität Kaiserslautern, 1990.<br />
* TRS/D33 Nachum Dershowitz: 33 Examples of Termination, 1995 Proc. French Spring School of Theoretical Computer Science, LNCS 909, http://www.math.tau.ac.il/~nachumd/papers/printemp-print.pdf<br />
* TRS/AG01 Thomas Arts, Jürgen Giesl: Termination of term rewriting using dependency pairs, 2000, http://dblp.uni-trier.de/rec/bibtex/journals/tcs/ArtsG00 http://verify.rwth-aachen.de/giesl/papers/ibn-97-46.ps<br />
* SRS/Zantema 128 string rewriting termination problems collected by Hans Zantema (2004?)<br />
<br />
TPDB problems are collected from a variety of sources, by a variety of contributors. Often, the author of the problem is not the creator of the respective TPDB file. Sometimes, TPDB file structure (directory names) have been changed.<br />
<br />
* SRS termination problems ICFP_2010 and ICFP_2010_relative were produced by participants of the ICFP 2010 programming contest, organized by Bertragm Felgenhauer and Johannes Waldmann. ''All'' of these problems are terminating by construction. See https://www.imn.htwk-leipzig.de/~waldmann/talk/10/icfp/<br />
<br />
== Tools ==<br />
* converter from pre-7 (textual) format to 7.* (XML) format: http://cl-informatik.uibk.ac.at/users/thiemann/convert.jar, usage:<br />
<br />
java -jar convert.jar someTrs.trs > someTrs.xml <br />
<br />
* converter from 7.* (XML) format to pre-7 (textual) format: [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB/raw-file/tip/xml/xtc2tpdb.xsl xtc2tpdb.xsl], already part of the [http://cl2-informatik.uibk.ac.at/mercurial.cgi/TPDB TPDB], usage:<br />
<br />
xsltproc xtc2tpdb.xsl someTrs.xml > someTrs.trs<br />
<br />
* Haskell library for reading and writing TPDB (plain and XML format) [http://hackage.haskell.org/package/tpdb]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=WST&diff=1800WST2018-07-15T13:15:05Z<p>J.waldmann: </p>
<hr />
<div>The International Workshop on Termination (WST) brings together, in an informal setting, researchers interested in all aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop also provides a ground for cross-fertilisation of ideas from term rewriting and from the different programming language communities.<br />
<br />
Upcoming events:<br />
<br />
* [http://wst2018.webs.upv.es/ 16th International Workshop on Termination] during [http://www.floc2018.org/ Federated Logic Conference (FLoC)], Oxford, United Kingdom, July 18-19, 2018.<br />
<br />
Information about previous workshops can be found online:<br />
* [http://cl-informatik.uibk.ac.at/events/wst-2016/ 15th International Workshop on Termination] at [http://cl-informatik.uibk.ac.at/events/cla-2016/ Computational Logic in the Alps], Obergurgl, Austria, September 5-7, 2016.<br />
* [https://easychair.org/smart-program/VSL2014/WST-index.html 14th International Workshop on Termination] during [http://vsl2014.at/ Vienna Summer of Logic], Vienna, Austria, July 17-18, 2014<br />
* Joint Workshop on Termination [http://www.imn.htwk-leipzig.de/WST2013/ WST2013] and on Foundational and Practical Aspects of Resource Analysis [http://fopara2013.cs.unibo.it/ FOPARA], Bertinoro, Italy, August 29-31, 2013<br />
* [http://cl-informatik.uibk.ac.at/users/georg/events/wst2012 12th International Workshop on Termination, Obergurgl, February 19-23, 2012]<br />
* [http://imada.sdu.dk/~petersk/WST2010/ 11th International Workshop on Termination, Edinburgh, 2010]<br />
* [https://portal.imn.htwk-leipzig.de/termine/10-international-workshop-on-termination/ 10th International Workshop on Termination, Leipzig, 2009]<br />
* [http://www.lsv.ens-cachan.fr/rdp07/wst.html 9th International Workshop on Termination, Paris, 2007]<br />
* [http://www.easychair.org/FLoC-06/WST.html 8th International Workshop on Termination, Seattle, 2006]<br />
* [http://www-i2.informatik.rwth-aachen.de/WST04/ 7th International Workshop on Termination, Aachen, 2004]<br />
* [http://www.dsic.upv.es/~rdp03/wst/ 6th International Workshop on Termination, Valencia, 2003]<br />
* [http://www.cs.tau.ac.il/~nachumd/wst/index.html 5th International Workshop on Termination, Utrecht, 2001]<br />
* [http://verify.rwth-aachen.de/giesl/WST99.html 4th International Workshop on Termination, Dagstuhl, 1999]<br />
* [http://www-i2.informatik.rwth-aachen.de/giesl/WST97/main.html 3rd International Workshop on Termination, Ede, 1997]<br />
* 2nd International Workshop on Termination, La Bresse, 1995<br />
* 1st International Workshop on Termination, St. Andrews, 1993<br />
Independently from WST, there are meetings on Certified Termination : [[WScT]]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=WST&diff=1799WST2018-07-15T13:13:19Z<p>J.waldmann: </p>
<hr />
<div>The International Workshop on Termination (WST) brings together, in an informal setting, researchers interested in all aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop also provides a ground for cross-fertilisation of ideas from term rewriting and from the different programming language communities.<br />
<br />
Upcoming events:<br />
<br />
* [http://wst2018.webs.upv.es/ 16th International Workshop on Termination] during [http://www.floc2018.org/ Federated Logic Conference (FLoC)], Oxford, United Kingdom, July 18-19, 2018.<br />
<br />
Information about previous workshops can be found online:<br />
* [http://cl-informatik.uibk.ac.at/events/wst-2016/ 15th International Workshop on Termination] at [http://cl-informatik.uibk.ac.at/events/cla-2016/ Computational Logic in the Alps], Obergurgl, Austria, September 5-7, 2016.<br />
* [https://easychair.org/smart-program/VSL2014/WST-index.html 14th International Workshop on Termination] during [http://vsl2014.at/ Vienna Summer of Logic], Vienna, Austria, July 17-18, 2014<br />
* Joint Workshop on Termination [http://www.imn.htwk-leipzig.de/WST2013/ WST2013] and on Foundational and Practical Aspects of Resource Analysis [http://fopara2013.cs.unibo.it/ FOPARA], Bertinoro, Italy, August 29-31, 2013<br />
* [http://cl-informatik.uibk.ac.at/users/georg/events/wst2012 12th International Workshop on Termination, Obergurgl, February 19-23, 2012]<br />
* [http://imada.sdu.dk/~petersk/WST2010/ 11th International Workshop on Termination, Edinburgh, 2010]<br />
* [https://portal.imn.htwk-leipzig.de/termine/10-international-workshop-on-termination/ 10th International Workshop on Termination, Leipzig, 2009]<br />
* [http://www.lsv.ens-cachan.fr/rdp07/wst.html 9th International Workshop on Termination, Paris, 2007]<br />
* [http://www.easychair.org/FLoC-06/WST.html 8th International Workshop on Terminaton, Seattle, 2006]<br />
* [http://www-i2.informatik.rwth-aachen.de/WST04/ 7th International Workshop on Terminaton, Aachen, 2004]<br />
* [http://www.dsic.upv.es/~rdp03/wst/ 6th International Workshop on Terminaton, Valencia, 2003]<br />
* [http://www.cs.tau.ac.il/~nachumd/wst/index.html 5th International Workshop on Terminaton, Utrecht, 2001]<br />
* [http://verify.rwth-aachen.de/giesl/WST99.html 4th International Workshop on Terminaton, Dagstuhl, 1999]<br />
* [http://www-i2.informatik.rwth-aachen.de/giesl/WST97/main.html 3rd International Workshop on Termination, Ede, 1997]<br />
* 2nd International Workshop on Termination, La Bresse, 1995<br />
* 1st International Workshop on Termination, St. Andrews, 1993<br />
Independently from WST, there are meetings on Certified Termination : [[WScT]]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=WST&diff=1798WST2018-07-15T13:08:41Z<p>J.waldmann: </p>
<hr />
<div>The International Workshop on Termination (WST) brings together, in an informal setting, researchers interested in all aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop also provides a ground for cross-fertilisation of ideas from term rewriting and from the different programming language communities.<br />
<br />
Upcoming events:<br />
<br />
* [http://wst2018.webs.upv.es/ 16th International Workshop on Termination] during [http://www.floc2018.org/ Federated Logic Conference (FLoC)], Oxford, United Kingdom, July 18-19, 2018.<br />
<br />
Information about previous workshops can be found online:<br />
* [http://cl-informatik.uibk.ac.at/events/wst-2016/ 15th International Workshop on Termination] at [http://cl-informatik.uibk.ac.at/events/cla-2016/ Computational Logic in the Alps], Obergurgl, Austria, September 5-7, 2016.<br />
* [http://vsl2014.at/wst/ 14th International Workshop on Termination] during [http://vsl2014.at/ Vienna Summer of Logic], Vienna, Austria, July 17-18, 2014<br />
* Joint Workshop on Termination [http://www.imn.htwk-leipzig.de/WST2013/ WST2013] and on Foundational and Practical Aspects of Resource Analysis [http://fopara2013.cs.unibo.it/ FOPARA], Bertinoro, Italy, August 29-31, 2013<br />
* [http://cl-informatik.uibk.ac.at/users/georg/events/wst2012 12th International Workshop on Termination, Obergurgl, February 19-23, 2012]<br />
* [http://imada.sdu.dk/~petersk/WST2010/ 11th International Workshop on Termination, Edinburgh, 2010]<br />
* [https://portal.imn.htwk-leipzig.de/termine/10-international-workshop-on-termination/ 10th International Workshop on Termination, Leipzig, 2009]<br />
* [http://www.lsv.ens-cachan.fr/rdp07/wst.html 9th International Workshop on Termination, Paris, 2007]<br />
* [http://www.easychair.org/FLoC-06/WST.html 8th International Workshop on Terminaton, Seattle, 2006]<br />
* [http://www-i2.informatik.rwth-aachen.de/WST04/ 7th International Workshop on Terminaton, Aachen, 2004]<br />
* [http://www.dsic.upv.es/~rdp03/wst/ 6th International Workshop on Terminaton, Valencia, 2003]<br />
* [http://www.cs.tau.ac.il/~nachumd/wst/index.html 5th International Workshop on Terminaton, Utrecht, 2001]<br />
* [http://verify.rwth-aachen.de/giesl/WST99.html 4th International Workshop on Terminaton, Dagstuhl, 1999]<br />
* [http://www-i2.informatik.rwth-aachen.de/giesl/WST97/main.html 3rd International Workshop on Termination, Ede, 1997]<br />
* 2nd International Workshop on Termination, La Bresse, 1995<br />
* 1st International Workshop on Termination, St. Andrews, 1993<br />
Independently from WST, there are meetings on Certified Termination : [[WScT]]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition&diff=1773Termination Competition2017-09-06T19:35:54Z<p>J.waldmann: /* History of Termination Competitions */</p>
<hr />
<div>= Annual International Termination Competition =<br />
<br />
During the 90's a number of new, powerful termination methods<br />
was developed. Thus, at the the beginning of the millennium<br />
many research groups started to develop [[:Category:Tools | tools for fully-automated termination analysis]].<br />
<br />
After a tool demonstration at the 2003 [[WST|Workshop on Termination]] in Valencia,<br />
the community decided to install an annual termination competition<br />
to spur the development of tools and new termination techniques.<br />
<br />
From 2004 till 2007, the competition organizer was Claude March&eacute;, [http://www.lri.fr/~marche/termination-competition/ Paris].<br />
From 2008 to 2013 the competition was run by Ren&eacute; Thiemann, [http://termcomp.uibk.ac.at Innsbruck].<br />
Since 2014, the competition organizer is Johannes Waldmann. Jobs are run on the [https://www.starexec.org/ Star Exec] platform at U Iowa. Results are aggregated and displayed at [http://nfa.imn.htwk-leipzig.de/termcomp/competition/20 HTWK Leipzig].<br />
<br />
== Upcoming Competitions ==<br />
[[Termination Competition 2017]]<br />
<br />
== Competition Categories ==<br />
<br />
Currently, the competition features the following categories:<br />
* termination of [[String Rewriting|string]] and [[Term Rewriting|term rewriting]]<br />
* [[Logic_Programming|termination of logic programs]]<br />
* [[Certified_Termination|certified termination]] of string and term rewriting (since 2007)<br />
* [[Functional_Programming|termination of functional programs]] (since 2007)<br />
* [http://cl-informatik.uibk.ac.at/users/georg/cbr/competition/ complexity of rewrite systems] (since 2008)<br />
* [[Java_Bytecode|termination of Java Bytecode programs]] (since 2009)<br />
* [[Higher_Order|termination of higher order rewriting]] (since 2010)<br />
* [[C_Programs|termination of C programs]] (since 2014)<br />
* termination of [[Transition_Systems|integer transition systems]] (since 2014)<br />
* [[ITRS|integer term rewriting]] (since 2014)<br />
* [[C_Integer_Programs|termination of C integer programs]]<br />
* [[Cycle_Rewriting|termination of cycle rewriting]]<br />
<br />
<br />
Discussion is open and primarily happens on the termtools mailing list.<br />
Decisions will be made by votes among the [[Termination Competition Steering Committee]], with current members<br />
* [http://verify.rwth-aachen.de/giesl/ Jürgen Giesl], RWTH Aachen<br />
* [https://www.cs.upc.edu/~albert/ Albert Rubio] (Chair), UPC Barcelona<br />
* [https://www.imn.htwk-leipzig.de/~waldmann/ Johannes Waldmann], HTWK Leipzig<br />
* [http://cl-informatik.uibk.ac.at/users/ayamada/ Akihisa Yamada], U. Innsbruck<br />
<br />
== Termination Problems Data Base ==<br />
<br />
The [[TPDB|Termination Problems Data Base]] collects all the problems used in the competitions. <br />
<br />
We welcome problem submissions from non-participants.<br />
<br />
== History of Termination Competitions ==<br />
<br />
The following competitions have taken place:<br />
<br />
* [[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]. <br />
<br />
* [[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]<br />
<br />
* [[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]<br />
<br />
* [[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]<br />
<br />
* [[Termination Competition 2013]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=437763 Results], [http://termcomp.uibk.ac.at/2013/competition2013.pdf Report]<br />
<br />
* [[Termination Competition 2012]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=362062 Results], [http://verify.rwth-aachen.de/giesl/competition2012.pdf Report]<br />
<br />
* [[Termination Competition 2011]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=230715 Results], [http://termcomp.uibk.ac.at/2011/competition2011.pdf Report]<br />
<br />
* [[Termination Competition 2010]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=185404 Results] <br />
<br />
* Termination Competition 2009 [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=101722 Results], [http://lists.lri.fr/pipermail/termtools/2009-November/000778.html Announcement]<br />
<br />
* [[Termination_Competition_2008|Termination Competition 2008]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=15991 Results], [http://www.imn.htwk-leipzig.de/~waldmann/talk/09/wst/ Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2007/ Termination Competition 2007], [http://www.imn.htwk-leipzig.de/~waldmann/talk/07/wst/competition/ Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2006/ Termination Competition 2006], [http://www.lri.fr/~marche/termination-competition/2006/reportCompetition2006.pdf Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2005/ Termination Competition 2005], [http://www.lri.fr/~marche/termination-competition/2005/TC.ppt Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2004/ Termination Competition 2004], [http://www.lri.fr/~marche/termination-competition/2004/slides-1jun2004.ps Report]<br />
<br />
== Static Backups of Results ==<br />
<br />
For many previous competitions, static backups of the results are availble [https://aprove-developers.github.io/termcomp_results/ here].</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition&diff=1772Termination Competition2017-09-06T19:35:18Z<p>J.waldmann: /* History of Termination Competitions */</p>
<hr />
<div>= Annual International Termination Competition =<br />
<br />
During the 90's a number of new, powerful termination methods<br />
was developed. Thus, at the the beginning of the millennium<br />
many research groups started to develop [[:Category:Tools | tools for fully-automated termination analysis]].<br />
<br />
After a tool demonstration at the 2003 [[WST|Workshop on Termination]] in Valencia,<br />
the community decided to install an annual termination competition<br />
to spur the development of tools and new termination techniques.<br />
<br />
From 2004 till 2007, the competition organizer was Claude March&eacute;, [http://www.lri.fr/~marche/termination-competition/ Paris].<br />
From 2008 to 2013 the competition was run by Ren&eacute; Thiemann, [http://termcomp.uibk.ac.at Innsbruck].<br />
Since 2014, the competition organizer is Johannes Waldmann. Jobs are run on the [https://www.starexec.org/ Star Exec] platform at U Iowa. Results are aggregated and displayed at [http://nfa.imn.htwk-leipzig.de/termcomp/competition/20 HTWK Leipzig].<br />
<br />
== Upcoming Competitions ==<br />
[[Termination Competition 2017]]<br />
<br />
== Competition Categories ==<br />
<br />
Currently, the competition features the following categories:<br />
* termination of [[String Rewriting|string]] and [[Term Rewriting|term rewriting]]<br />
* [[Logic_Programming|termination of logic programs]]<br />
* [[Certified_Termination|certified termination]] of string and term rewriting (since 2007)<br />
* [[Functional_Programming|termination of functional programs]] (since 2007)<br />
* [http://cl-informatik.uibk.ac.at/users/georg/cbr/competition/ complexity of rewrite systems] (since 2008)<br />
* [[Java_Bytecode|termination of Java Bytecode programs]] (since 2009)<br />
* [[Higher_Order|termination of higher order rewriting]] (since 2010)<br />
* [[C_Programs|termination of C programs]] (since 2014)<br />
* termination of [[Transition_Systems|integer transition systems]] (since 2014)<br />
* [[ITRS|integer term rewriting]] (since 2014)<br />
* [[C_Integer_Programs|termination of C integer programs]]<br />
* [[Cycle_Rewriting|termination of cycle rewriting]]<br />
<br />
<br />
Discussion is open and primarily happens on the termtools mailing list.<br />
Decisions will be made by votes among the [[Termination Competition Steering Committee]], with current members<br />
* [http://verify.rwth-aachen.de/giesl/ Jürgen Giesl], RWTH Aachen<br />
* [https://www.cs.upc.edu/~albert/ Albert Rubio] (Chair), UPC Barcelona<br />
* [https://www.imn.htwk-leipzig.de/~waldmann/ Johannes Waldmann], HTWK Leipzig<br />
* [http://cl-informatik.uibk.ac.at/users/ayamada/ Akihisa Yamada], U. Innsbruck<br />
<br />
== Termination Problems Data Base ==<br />
<br />
The [[TPDB|Termination Problems Data Base]] collects all the problems used in the competitions. <br />
<br />
We welcome problem submissions from non-participants.<br />
<br />
== History of Termination Competitions ==<br />
<br />
The following competitions have taken place:<br />
<br />
* [[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]. <br />
<br />
* [[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]<br />
<br />
* [[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]<br />
<br />
* [[Termination Competition 2014]], [http://termcomp.imn.htwk-leipzig.de/competition/Y2014 Results of Competition], [http://nfa.imn.htwk-leipzig.de/termcomp/competition/23 Results of Demonstration]<br />
<br />
* [[Termination Competition 2013]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=437763 Results], [http://termcomp.uibk.ac.at/2013/competition2013.pdf Report]<br />
<br />
* [[Termination Competition 2012]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=362062 Results], [http://verify.rwth-aachen.de/giesl/competition2012.pdf Report]<br />
<br />
* [[Termination Competition 2011]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=230715 Results], [http://termcomp.uibk.ac.at/2011/competition2011.pdf Report]<br />
<br />
* [[Termination Competition 2010]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=185404 Results] <br />
<br />
* Termination Competition 2009 [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=101722 Results], [http://lists.lri.fr/pipermail/termtools/2009-November/000778.html Announcement]<br />
<br />
* [[Termination_Competition_2008|Termination Competition 2008]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=15991 Results], [http://www.imn.htwk-leipzig.de/~waldmann/talk/09/wst/ Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2007/ Termination Competition 2007], [http://www.imn.htwk-leipzig.de/~waldmann/talk/07/wst/competition/ Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2006/ Termination Competition 2006], [http://www.lri.fr/~marche/termination-competition/2006/reportCompetition2006.pdf Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2005/ Termination Competition 2005], [http://www.lri.fr/~marche/termination-competition/2005/TC.ppt Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2004/ Termination Competition 2004], [http://www.lri.fr/~marche/termination-competition/2004/slides-1jun2004.ps Report]<br />
<br />
== Static Backups of Results ==<br />
<br />
For many previous competitions, static backups of the results are availble [https://aprove-developers.github.io/termcomp_results/ here].</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition&diff=1771Termination Competition2017-09-06T19:32:50Z<p>J.waldmann: /* History of Termination Competitions */</p>
<hr />
<div>= Annual International Termination Competition =<br />
<br />
During the 90's a number of new, powerful termination methods<br />
was developed. Thus, at the the beginning of the millennium<br />
many research groups started to develop [[:Category:Tools | tools for fully-automated termination analysis]].<br />
<br />
After a tool demonstration at the 2003 [[WST|Workshop on Termination]] in Valencia,<br />
the community decided to install an annual termination competition<br />
to spur the development of tools and new termination techniques.<br />
<br />
From 2004 till 2007, the competition organizer was Claude March&eacute;, [http://www.lri.fr/~marche/termination-competition/ Paris].<br />
From 2008 to 2013 the competition was run by Ren&eacute; Thiemann, [http://termcomp.uibk.ac.at Innsbruck].<br />
Since 2014, the competition organizer is Johannes Waldmann. Jobs are run on the [https://www.starexec.org/ Star Exec] platform at U Iowa. Results are aggregated and displayed at [http://nfa.imn.htwk-leipzig.de/termcomp/competition/20 HTWK Leipzig].<br />
<br />
== Upcoming Competitions ==<br />
[[Termination Competition 2017]]<br />
<br />
== Competition Categories ==<br />
<br />
Currently, the competition features the following categories:<br />
* termination of [[String Rewriting|string]] and [[Term Rewriting|term rewriting]]<br />
* [[Logic_Programming|termination of logic programs]]<br />
* [[Certified_Termination|certified termination]] of string and term rewriting (since 2007)<br />
* [[Functional_Programming|termination of functional programs]] (since 2007)<br />
* [http://cl-informatik.uibk.ac.at/users/georg/cbr/competition/ complexity of rewrite systems] (since 2008)<br />
* [[Java_Bytecode|termination of Java Bytecode programs]] (since 2009)<br />
* [[Higher_Order|termination of higher order rewriting]] (since 2010)<br />
* [[C_Programs|termination of C programs]] (since 2014)<br />
* termination of [[Transition_Systems|integer transition systems]] (since 2014)<br />
* [[ITRS|integer term rewriting]] (since 2014)<br />
* [[C_Integer_Programs|termination of C integer programs]]<br />
* [[Cycle_Rewriting|termination of cycle rewriting]]<br />
<br />
<br />
Discussion is open and primarily happens on the termtools mailing list.<br />
Decisions will be made by votes among the [[Termination Competition Steering Committee]], with current members<br />
* [http://verify.rwth-aachen.de/giesl/ Jürgen Giesl], RWTH Aachen<br />
* [https://www.cs.upc.edu/~albert/ Albert Rubio] (Chair), UPC Barcelona<br />
* [https://www.imn.htwk-leipzig.de/~waldmann/ Johannes Waldmann], HTWK Leipzig<br />
* [http://cl-informatik.uibk.ac.at/users/ayamada/ Akihisa Yamada], U. Innsbruck<br />
<br />
== Termination Problems Data Base ==<br />
<br />
The [[TPDB|Termination Problems Data Base]] collects all the problems used in the competitions. <br />
<br />
We welcome problem submissions from non-participants.<br />
<br />
== History of Termination Competitions ==<br />
<br />
The following competitions have taken place:<br />
<br />
* [[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]. <br />
<br />
* [[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]<br />
<br />
* [[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]<br />
<br />
* [[Termination Competition 2014]], [http://termcomp.imn.htwk-leipzig.de/competition/Y2014 Results of Competition], [http://nfa.imn.htwk-leipzig.de/termcomp/competition/23 Results of Demonstration]<br />
<br />
* [[Termination Competition 2013]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=437763 Results], [http://termcomp.uibk.ac.at/2013/competition2013.pdf Report]<br />
<br />
* [[Termination Competition 2012]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=362062 Results], [http://verify.rwth-aachen.de/giesl/competition2012.pdf Report]<br />
<br />
* [[Termination Competition 2011]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=230715 Results], [http://termcomp.uibk.ac.at/2011/competition2011.pdf Report]<br />
<br />
* [[Termination Competition 2010]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=185404 Results] <br />
<br />
* Termination Competition 2009 [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=101722 Results], [http://lists.lri.fr/pipermail/termtools/2009-November/000778.html Announcement]<br />
<br />
* [[Termination_Competition_2008|Termination Competition 2008]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=15991 Results], [http://www.imn.htwk-leipzig.de/~waldmann/talk/09/wst/ Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2007/ Termination Competition 2007], [http://www.imn.htwk-leipzig.de/~waldmann/talk/07/wst/competition/ Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2006/ Termination Competition 2006], [http://www.lri.fr/~marche/termination-competition/2006/reportCompetition2006.pdf Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2005/ Termination Competition 2005], [http://www.lri.fr/~marche/termination-competition/2005/TC.ppt Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2004/ Termination Competition 2004], [http://www.lri.fr/~marche/termination-competition/2004/slides-1jun2004.ps Report]<br />
<br />
== Static Backups of Results ==<br />
<br />
For many previous competitions, static backups of the results are availble [https://aprove-developers.github.io/termcomp_results/ here].</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition_2017&diff=1770Termination Competition 20172017-09-06T19:29:14Z<p>J.waldmann: </p>
<hr />
<div>In 2017, the Termination and Complexity Competition <!-- ([http://lists.lri.fr/pipermail/termtools/2015-June/000984.html Call for Participation]) --> will be affiliated with the [http://www.cs.ox.ac.uk/conferences/fscd2017/ Second International Conference on Formal Structures for Computation and Deduction (FSCD)] and it will take place "live" during the conference. The competition will be run on the [http://www.starexec.org/ StarExec platform].<br />
<br />
== Dates ==<br />
<br />
* Tool Registration: July 31, 2017 (detail: [[Termination_Competition_2017_Registration]])<br />
* Problem Submission: August 14, 2017 <br />
* Updates of Registered Tools: August 21, 2017 <br />
* Competition: September 5-6, 2017<br />
<br />
== Results == <br />
<br />
* competition https://termcomp.imn.htwk-leipzig.de/competitions/Y2017<br />
* demonstration https://termcomp.imn.htwk-leipzig.de/competitions/67<br />
<br />
== Competition Categories ==<br />
<br />
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, ...)<br />
<br />
== Competition Procedure ==<br />
<br />
All participants in the same category will be run on a [http://www.termination-portal.org/wiki/Termination_Competition_Problem_Selection_Algorithm subset] of the existing problems of this category. The number of problems used in the competition is not fixed and will depend on the number of existing problems. The problem selection algorithm will be the same as in previous years [[Termination_Competition_Problem_Selection_Algorithm]]. The selection is made so that the whole competition will be executed live during the FSCD 2017. <br />
There might be modifications of the rules suggested by the organizer and decided by the SC.<br />
<br />
The wall-clock timeout will be 300 seconds, and 4 cores will be available (if a tool wants to use concurrent execution).<br />
The tools will be started in their directory and obtain<br />
<br />
* the problem file name on the command line,<br />
* and extra info from environment variables, cf. [[Termination Competition 2014 technical details]]<br />
<br />
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 [http://www.termination-portal.org/wiki/Termination_Competition_Certified_Categories_Competition certified] (see also the [http://cl-informatik.uibk.ac.at/software/cpf/ CPF-website]) and [http://cl-informatik.uibk.ac.at/users/georg/cbr/competition/ complexity] categories. See all existing [http://www.termination-portal.org/wiki/Category:Categories categories] for more details.<br />
<br />
For those problems where a correct answer is (partially) known, any contradictory answer will be penalized by -10 points.<br />
<!-- Moreover, those buggy systems may have the opportunity to provide a corrected version that will be run again after the end of the live execution (displaying the new results afterwards, but out of competition). --><br />
<br />
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).<br />
<br />
== Committees ==<br />
<br />
Steering Committee<br />
* Jürgen Giesl, RWTH Aachen, Germany<br />
* Albert Rubio (chair), UPC Barcelona, Spain<br />
* Johannes Waldmann, HTWK Leipzig, Germany<br />
* Akihisa Yamada, Universität Innsbruck, Austria<br />
<br />
Organizing Commmittee<br />
* Johannes Waldmann, HTWK Leipzig, Germany (StarExec)<br />
* Akihisa Yamada, Universität Innsbruck, Austria (CPF and TPDB)<br />
<br />
== Registration ==<br />
<br />
Participants must register<br />
<br />
* on Starexec (so you can upload and test your solver): enter your data at [https://www.starexec.org/starexec/public/registration.jsp StarExecRegistration], indicating the competition categories where they plan to enter tools and problems, and then upload their contributions to [http://www.starexec.org StarExec]<br />
<br />
* *and* with the competition's organizer, J. Waldmann (so I known what solver/configuration to use). Details will be announced here: [[Termination Competition 2017 Registration]]<br />
<br />
Note: if I (J. Waldmann) don't know you ("knowing" is roughly symmetrical), then I will ask you to specify: what termination tool you're working on, what competition categories you plan to take part in, your affiliation (in case you're a student, also the name of your advisor/research group leader). The email address you give in the registration should be your institutional one.<br />
<br />
We recommend to register early. After the deadline, access to [http://www.starexec.org StarExec] might be restricted. We need time to prepare the competition, and other competitions may be running in parallel.<br />
<br />
It is highly recommended that participants also subscribe to the [http://lists.lri.fr/mailman/listinfo/termtools termtools] mailing list, because that is where announcements will be made, and where discussion takes place.<br />
<br />
== StarExec Information ==<br />
<br />
this refers to StarExec in general, and not to Termination in particular.<br />
<br />
* [https://wiki.uiowa.edu/display/stardev/User+Guide user guide]<br />
* [https://www.tapatalk.com/groups/starexec/index.php announcements and discussion] ([https://www.tapatalk.com/groups/starexec/app.php/feed combined feed for recent messages])<br />
* [http://starexec.forumotion.com/ announcements and discussion] (discontinued, but contains some information that is still valid and not available elsewhere)<br />
<br />
== Technical Detail ==<br />
<br />
The competition will be running on [http://www.starexec.org/ 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.<br />
<br />
Competition data will be presented via [https://github.com/stefanvonderkrone/star-exec-presenter star-exec-presenter] - developed and running at HTWK Leipzig.<br />
<br />
Technical details about the execution platform (as of 2014) can be found [http://www.termination-portal.org/wiki/Termination_Competition_2014_technical_details here].<br />
<br />
<br />
== Contact ==<br />
<br />
To contact the steering committee of the termination competition, send an email to terminationcompetitionsc<at>lists.rwth-aachen.de. <br />
<br />
The competition organizers can be reached at johannes.waldmann<at>htwk-leipzig.de<br />
<br />
Send new problems for the competition to akihisa.yamada<at>uibk.ac.at<br />
<br />
== Changes with respect to 2016 ==<br />
<br />
These lists reflect the discussion in the community, and in the steering committee. Items are preliminary, and not officially binding. <br />
Please do not edit this list (unless you're in the SC). Instead, send proposals to termtools or terminationcompetitionsc mailing list,<br />
or create a new wiki page and put a link here.<br />
<br />
<!--<br />
Proposed changes: --><br />
<br />
* New category proposal: Certified [[Transition Systems|ITS]] Termination<br />
<!--<br />
Adopted changes: --><br />
<br />
<br />
<!--<br />
== TODO ==<br />
<br />
See [[Termination Competition 2016 TODO]]<br />
--></div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition_2017&diff=1769Termination Competition 20172017-09-06T19:28:46Z<p>J.waldmann: /* Dates */</p>
<hr />
<div>In 2017, the Termination and Complexity Competition <!-- ([http://lists.lri.fr/pipermail/termtools/2015-June/000984.html Call for Participation]) --> will be affiliated with the [http://www.cs.ox.ac.uk/conferences/fscd2017/ Second International Conference on Formal Structures for Computation and Deduction (FSCD)] and it will take place "live" during the conference. The competition will be run on the [http://www.starexec.org/ StarExec platform].<br />
<br />
== Dates ==<br />
<br />
* Tool Registration: July 31, 2017 (detail: [[Termination_Competition_2017_Registration]])<br />
* Problem Submission: August 14, 2017 <br />
* Updates of Registered Tools: August 21, 2017 <br />
* Competition: September 5-6, 2017<br />
* live data and results: <br />
** competition https://termcomp.imn.htwk-leipzig.de/competitions/Y2017<br />
** demonstration https://termcomp.imn.htwk-leipzig.de/competitions/67<br />
<br />
== Competition Categories ==<br />
<br />
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, ...)<br />
<br />
== Competition Procedure ==<br />
<br />
All participants in the same category will be run on a [http://www.termination-portal.org/wiki/Termination_Competition_Problem_Selection_Algorithm subset] of the existing problems of this category. The number of problems used in the competition is not fixed and will depend on the number of existing problems. The problem selection algorithm will be the same as in previous years [[Termination_Competition_Problem_Selection_Algorithm]]. The selection is made so that the whole competition will be executed live during the FSCD 2017. <br />
There might be modifications of the rules suggested by the organizer and decided by the SC.<br />
<br />
The wall-clock timeout will be 300 seconds, and 4 cores will be available (if a tool wants to use concurrent execution).<br />
The tools will be started in their directory and obtain<br />
<br />
* the problem file name on the command line,<br />
* and extra info from environment variables, cf. [[Termination Competition 2014 technical details]]<br />
<br />
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 [http://www.termination-portal.org/wiki/Termination_Competition_Certified_Categories_Competition certified] (see also the [http://cl-informatik.uibk.ac.at/software/cpf/ CPF-website]) and [http://cl-informatik.uibk.ac.at/users/georg/cbr/competition/ complexity] categories. See all existing [http://www.termination-portal.org/wiki/Category:Categories categories] for more details.<br />
<br />
For those problems where a correct answer is (partially) known, any contradictory answer will be penalized by -10 points.<br />
<!-- Moreover, those buggy systems may have the opportunity to provide a corrected version that will be run again after the end of the live execution (displaying the new results afterwards, but out of competition). --><br />
<br />
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).<br />
<br />
== Committees ==<br />
<br />
Steering Committee<br />
* Jürgen Giesl, RWTH Aachen, Germany<br />
* Albert Rubio (chair), UPC Barcelona, Spain<br />
* Johannes Waldmann, HTWK Leipzig, Germany<br />
* Akihisa Yamada, Universität Innsbruck, Austria<br />
<br />
Organizing Commmittee<br />
* Johannes Waldmann, HTWK Leipzig, Germany (StarExec)<br />
* Akihisa Yamada, Universität Innsbruck, Austria (CPF and TPDB)<br />
<br />
== Registration ==<br />
<br />
Participants must register<br />
<br />
* on Starexec (so you can upload and test your solver): enter your data at [https://www.starexec.org/starexec/public/registration.jsp StarExecRegistration], indicating the competition categories where they plan to enter tools and problems, and then upload their contributions to [http://www.starexec.org StarExec]<br />
<br />
* *and* with the competition's organizer, J. Waldmann (so I known what solver/configuration to use). Details will be announced here: [[Termination Competition 2017 Registration]]<br />
<br />
Note: if I (J. Waldmann) don't know you ("knowing" is roughly symmetrical), then I will ask you to specify: what termination tool you're working on, what competition categories you plan to take part in, your affiliation (in case you're a student, also the name of your advisor/research group leader). The email address you give in the registration should be your institutional one.<br />
<br />
We recommend to register early. After the deadline, access to [http://www.starexec.org StarExec] might be restricted. We need time to prepare the competition, and other competitions may be running in parallel.<br />
<br />
It is highly recommended that participants also subscribe to the [http://lists.lri.fr/mailman/listinfo/termtools termtools] mailing list, because that is where announcements will be made, and where discussion takes place.<br />
<br />
== StarExec Information ==<br />
<br />
this refers to StarExec in general, and not to Termination in particular.<br />
<br />
* [https://wiki.uiowa.edu/display/stardev/User+Guide user guide]<br />
* [https://www.tapatalk.com/groups/starexec/index.php announcements and discussion] ([https://www.tapatalk.com/groups/starexec/app.php/feed combined feed for recent messages])<br />
* [http://starexec.forumotion.com/ announcements and discussion] (discontinued, but contains some information that is still valid and not available elsewhere)<br />
<br />
== Technical Detail ==<br />
<br />
The competition will be running on [http://www.starexec.org/ 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.<br />
<br />
Competition data will be presented via [https://github.com/stefanvonderkrone/star-exec-presenter star-exec-presenter] - developed and running at HTWK Leipzig.<br />
<br />
Technical details about the execution platform (as of 2014) can be found [http://www.termination-portal.org/wiki/Termination_Competition_2014_technical_details here].<br />
<br />
<br />
== Contact ==<br />
<br />
To contact the steering committee of the termination competition, send an email to terminationcompetitionsc<at>lists.rwth-aachen.de. <br />
<br />
The competition organizers can be reached at johannes.waldmann<at>htwk-leipzig.de<br />
<br />
Send new problems for the competition to akihisa.yamada<at>uibk.ac.at<br />
<br />
== Changes with respect to 2016 ==<br />
<br />
These lists reflect the discussion in the community, and in the steering committee. Items are preliminary, and not officially binding. <br />
Please do not edit this list (unless you're in the SC). Instead, send proposals to termtools or terminationcompetitionsc mailing list,<br />
or create a new wiki page and put a link here.<br />
<br />
<!--<br />
Proposed changes: --><br />
<br />
* New category proposal: Certified [[Transition Systems|ITS]] Termination<br />
<!--<br />
Adopted changes: --><br />
<br />
<br />
<!--<br />
== TODO ==<br />
<br />
See [[Termination Competition 2016 TODO]]<br />
--></div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition_2017&diff=1768Termination Competition 20172017-09-06T00:22:51Z<p>J.waldmann: /* Dates */</p>
<hr />
<div>In 2017, the Termination and Complexity Competition <!-- ([http://lists.lri.fr/pipermail/termtools/2015-June/000984.html Call for Participation]) --> will be affiliated with the [http://www.cs.ox.ac.uk/conferences/fscd2017/ Second International Conference on Formal Structures for Computation and Deduction (FSCD)] and it will take place "live" during the conference. The competition will be run on the [http://www.starexec.org/ StarExec platform].<br />
<br />
== Dates ==<br />
<br />
* Tool Registration: July 31, 2017 (detail: [[Termination_Competition_2017_Registration]])<br />
* Problem Submission: August 14, 2017 <br />
* Updates of Registered Tools: August 21, 2017 <br />
* Competition: September 5-6, 2017 (live data and results: https://termcomp.imn.htwk-leipzig.de/competitions/Y2017)<br />
<br />
== Competition Categories ==<br />
<br />
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, ...)<br />
<br />
== Competition Procedure ==<br />
<br />
All participants in the same category will be run on a [http://www.termination-portal.org/wiki/Termination_Competition_Problem_Selection_Algorithm subset] of the existing problems of this category. The number of problems used in the competition is not fixed and will depend on the number of existing problems. The problem selection algorithm will be the same as in previous years [[Termination_Competition_Problem_Selection_Algorithm]]. The selection is made so that the whole competition will be executed live during the FSCD 2017. <br />
There might be modifications of the rules suggested by the organizer and decided by the SC.<br />
<br />
The wall-clock timeout will be 300 seconds, and 4 cores will be available (if a tool wants to use concurrent execution).<br />
The tools will be started in their directory and obtain<br />
<br />
* the problem file name on the command line,<br />
* and extra info from environment variables, cf. [[Termination Competition 2014 technical details]]<br />
<br />
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 [http://www.termination-portal.org/wiki/Termination_Competition_Certified_Categories_Competition certified] (see also the [http://cl-informatik.uibk.ac.at/software/cpf/ CPF-website]) and [http://cl-informatik.uibk.ac.at/users/georg/cbr/competition/ complexity] categories. See all existing [http://www.termination-portal.org/wiki/Category:Categories categories] for more details.<br />
<br />
For those problems where a correct answer is (partially) known, any contradictory answer will be penalized by -10 points.<br />
<!-- Moreover, those buggy systems may have the opportunity to provide a corrected version that will be run again after the end of the live execution (displaying the new results afterwards, but out of competition). --><br />
<br />
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).<br />
<br />
== Committees ==<br />
<br />
Steering Committee<br />
* Jürgen Giesl, RWTH Aachen, Germany<br />
* Albert Rubio (chair), UPC Barcelona, Spain<br />
* Johannes Waldmann, HTWK Leipzig, Germany<br />
* Akihisa Yamada, Universität Innsbruck, Austria<br />
<br />
Organizing Commmittee<br />
* Johannes Waldmann, HTWK Leipzig, Germany (StarExec)<br />
* Akihisa Yamada, Universität Innsbruck, Austria (CPF and TPDB)<br />
<br />
== Registration ==<br />
<br />
Participants must register<br />
<br />
* on Starexec (so you can upload and test your solver): enter your data at [https://www.starexec.org/starexec/public/registration.jsp StarExecRegistration], indicating the competition categories where they plan to enter tools and problems, and then upload their contributions to [http://www.starexec.org StarExec]<br />
<br />
* *and* with the competition's organizer, J. Waldmann (so I known what solver/configuration to use). Details will be announced here: [[Termination Competition 2017 Registration]]<br />
<br />
Note: if I (J. Waldmann) don't know you ("knowing" is roughly symmetrical), then I will ask you to specify: what termination tool you're working on, what competition categories you plan to take part in, your affiliation (in case you're a student, also the name of your advisor/research group leader). The email address you give in the registration should be your institutional one.<br />
<br />
We recommend to register early. After the deadline, access to [http://www.starexec.org StarExec] might be restricted. We need time to prepare the competition, and other competitions may be running in parallel.<br />
<br />
It is highly recommended that participants also subscribe to the [http://lists.lri.fr/mailman/listinfo/termtools termtools] mailing list, because that is where announcements will be made, and where discussion takes place.<br />
<br />
== StarExec Information ==<br />
<br />
this refers to StarExec in general, and not to Termination in particular.<br />
<br />
* [https://wiki.uiowa.edu/display/stardev/User+Guide user guide]<br />
* [https://www.tapatalk.com/groups/starexec/index.php announcements and discussion] ([https://www.tapatalk.com/groups/starexec/app.php/feed combined feed for recent messages])<br />
* [http://starexec.forumotion.com/ announcements and discussion] (discontinued, but contains some information that is still valid and not available elsewhere)<br />
<br />
== Technical Detail ==<br />
<br />
The competition will be running on [http://www.starexec.org/ 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.<br />
<br />
Competition data will be presented via [https://github.com/stefanvonderkrone/star-exec-presenter star-exec-presenter] - developed and running at HTWK Leipzig.<br />
<br />
Technical details about the execution platform (as of 2014) can be found [http://www.termination-portal.org/wiki/Termination_Competition_2014_technical_details here].<br />
<br />
<br />
== Contact ==<br />
<br />
To contact the steering committee of the termination competition, send an email to terminationcompetitionsc<at>lists.rwth-aachen.de. <br />
<br />
The competition organizers can be reached at johannes.waldmann<at>htwk-leipzig.de<br />
<br />
Send new problems for the competition to akihisa.yamada<at>uibk.ac.at<br />
<br />
== Changes with respect to 2016 ==<br />
<br />
These lists reflect the discussion in the community, and in the steering committee. Items are preliminary, and not officially binding. <br />
Please do not edit this list (unless you're in the SC). Instead, send proposals to termtools or terminationcompetitionsc mailing list,<br />
or create a new wiki page and put a link here.<br />
<br />
<!--<br />
Proposed changes: --><br />
<br />
* New category proposal: Certified [[Transition Systems|ITS]] Termination<br />
<!--<br />
Adopted changes: --><br />
<br />
<br />
<!--<br />
== TODO ==<br />
<br />
See [[Termination Competition 2016 TODO]]<br />
--></div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition_2017&diff=1767Termination Competition 20172017-09-05T14:30:55Z<p>J.waldmann: /* Dates */</p>
<hr />
<div>In 2017, the Termination and Complexity Competition <!-- ([http://lists.lri.fr/pipermail/termtools/2015-June/000984.html Call for Participation]) --> will be affiliated with the [http://www.cs.ox.ac.uk/conferences/fscd2017/ Second International Conference on Formal Structures for Computation and Deduction (FSCD)] and it will take place "live" during the conference. The competition will be run on the [http://www.starexec.org/ StarExec platform].<br />
<br />
== Dates ==<br />
<br />
* Tool Registration: July 31, 2017 (detail: [[Termination_Competition_2017_Registration]])<br />
* Problem Submission: August 14, 2017 <br />
* Updates of Registered Tools: August 21, 2017 <br />
* Competition: September 5-6, 2017 (live data and results: https://termcomp.imn.htwk-leipzig.de/competitions/65)<br />
<br />
== Competition Categories ==<br />
<br />
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, ...)<br />
<br />
== Competition Procedure ==<br />
<br />
All participants in the same category will be run on a [http://www.termination-portal.org/wiki/Termination_Competition_Problem_Selection_Algorithm subset] of the existing problems of this category. The number of problems used in the competition is not fixed and will depend on the number of existing problems. The problem selection algorithm will be the same as in previous years [[Termination_Competition_Problem_Selection_Algorithm]]. The selection is made so that the whole competition will be executed live during the FSCD 2017. <br />
There might be modifications of the rules suggested by the organizer and decided by the SC.<br />
<br />
The wall-clock timeout will be 300 seconds, and 4 cores will be available (if a tool wants to use concurrent execution).<br />
The tools will be started in their directory and obtain<br />
<br />
* the problem file name on the command line,<br />
* and extra info from environment variables, cf. [[Termination Competition 2014 technical details]]<br />
<br />
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 [http://www.termination-portal.org/wiki/Termination_Competition_Certified_Categories_Competition certified] (see also the [http://cl-informatik.uibk.ac.at/software/cpf/ CPF-website]) and [http://cl-informatik.uibk.ac.at/users/georg/cbr/competition/ complexity] categories. See all existing [http://www.termination-portal.org/wiki/Category:Categories categories] for more details.<br />
<br />
For those problems where a correct answer is (partially) known, any contradictory answer will be penalized by -10 points.<br />
<!-- Moreover, those buggy systems may have the opportunity to provide a corrected version that will be run again after the end of the live execution (displaying the new results afterwards, but out of competition). --><br />
<br />
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).<br />
<br />
== Committees ==<br />
<br />
Steering Committee<br />
* Jürgen Giesl, RWTH Aachen, Germany<br />
* Albert Rubio (chair), UPC Barcelona, Spain<br />
* Johannes Waldmann, HTWK Leipzig, Germany<br />
* Akihisa Yamada, Universität Innsbruck, Austria<br />
<br />
Organizing Commmittee<br />
* Johannes Waldmann, HTWK Leipzig, Germany (StarExec)<br />
* Akihisa Yamada, Universität Innsbruck, Austria (CPF and TPDB)<br />
<br />
== Registration ==<br />
<br />
Participants must register<br />
<br />
* on Starexec (so you can upload and test your solver): enter your data at [https://www.starexec.org/starexec/public/registration.jsp StarExecRegistration], indicating the competition categories where they plan to enter tools and problems, and then upload their contributions to [http://www.starexec.org StarExec]<br />
<br />
* *and* with the competition's organizer, J. Waldmann (so I known what solver/configuration to use). Details will be announced here: [[Termination Competition 2017 Registration]]<br />
<br />
Note: if I (J. Waldmann) don't know you ("knowing" is roughly symmetrical), then I will ask you to specify: what termination tool you're working on, what competition categories you plan to take part in, your affiliation (in case you're a student, also the name of your advisor/research group leader). The email address you give in the registration should be your institutional one.<br />
<br />
We recommend to register early. After the deadline, access to [http://www.starexec.org StarExec] might be restricted. We need time to prepare the competition, and other competitions may be running in parallel.<br />
<br />
It is highly recommended that participants also subscribe to the [http://lists.lri.fr/mailman/listinfo/termtools termtools] mailing list, because that is where announcements will be made, and where discussion takes place.<br />
<br />
== StarExec Information ==<br />
<br />
this refers to StarExec in general, and not to Termination in particular.<br />
<br />
* [https://wiki.uiowa.edu/display/stardev/User+Guide user guide]<br />
* [https://www.tapatalk.com/groups/starexec/index.php announcements and discussion] ([https://www.tapatalk.com/groups/starexec/app.php/feed combined feed for recent messages])<br />
* [http://starexec.forumotion.com/ announcements and discussion] (discontinued, but contains some information that is still valid and not available elsewhere)<br />
<br />
== Technical Detail ==<br />
<br />
The competition will be running on [http://www.starexec.org/ 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.<br />
<br />
Competition data will be presented via [https://github.com/stefanvonderkrone/star-exec-presenter star-exec-presenter] - developed and running at HTWK Leipzig.<br />
<br />
Technical details about the execution platform (as of 2014) can be found [http://www.termination-portal.org/wiki/Termination_Competition_2014_technical_details here].<br />
<br />
<br />
== Contact ==<br />
<br />
To contact the steering committee of the termination competition, send an email to terminationcompetitionsc<at>lists.rwth-aachen.de. <br />
<br />
The competition organizers can be reached at johannes.waldmann<at>htwk-leipzig.de<br />
<br />
Send new problems for the competition to akihisa.yamada<at>uibk.ac.at<br />
<br />
== Changes with respect to 2016 ==<br />
<br />
These lists reflect the discussion in the community, and in the steering committee. Items are preliminary, and not officially binding. <br />
Please do not edit this list (unless you're in the SC). Instead, send proposals to termtools or terminationcompetitionsc mailing list,<br />
or create a new wiki page and put a link here.<br />
<br />
<!--<br />
Proposed changes: --><br />
<br />
* New category proposal: Certified [[Transition Systems|ITS]] Termination<br />
<!--<br />
Adopted changes: --><br />
<br />
<br />
<!--<br />
== TODO ==<br />
<br />
See [[Termination Competition 2016 TODO]]<br />
--></div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition_2016_Data&diff=1761Termination Competition 2016 Data2017-08-16T13:04:18Z<p>J.waldmann: </p>
<hr />
<div>[https://termcomp.imn.htwk-leipzig.de/competitions/Y2016 Competition live data and results]<br />
(Note: display of time is [https://github.com/jwaldmann/star-exec-presenter/issues/125 wrong])<br />
<br />
== Timeline ==<br />
<br />
(all times are Obergurgl local time = CEST)<br />
<br />
* around 09:00 start Termination and Complexity Analysis of Programs<br />
* around 10:30 start Termination and Complexity Analysis of Rewriting<br />
* around 14:00 results should be available (probably a bit earlier)<br />
<br />
== Extra Information ==<br />
<br />
* [https://termcomp.imn.htwk-leipzig.de/registered/Y2016 participants]<br />
* [https://termcomp.imn.htwk-leipzig.de/combine/20/4/172 compare] current results to previous competitions (last column, provides options to merge solvers into "virtual best solver")<br />
<br />
== Comments ==<br />
<br />
* on organizational matters: write to the termtools mailing list [[Termtools]]<br />
* technical issues with the star-exec-presenter software: [https://github.com/jwaldmann/star-exec-presenter/issues]<br />
<br />
* comments by the organizer: [https://www.imn.htwk-leipzig.de/~waldmann/talk/16/termcomp]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition_2017&diff=1760Termination Competition 20172017-08-16T09:42:37Z<p>J.waldmann: /* StarExec Information */</p>
<hr />
<div>In 2017, the Termination and Complexity Competition <!-- ([http://lists.lri.fr/pipermail/termtools/2015-June/000984.html Call for Participation]) --> will be affiliated with the [http://www.cs.ox.ac.uk/conferences/fscd2017/ Second International Conference on Formal Structures for Computation and Deduction (FSCD)] and it will take place "live" during the conference. The competition will be run on the [http://www.starexec.org/ StarExec platform].<br />
<br />
== Dates ==<br />
<br />
* Tool Registration: July 31, 2017 (detail: [[Termination_Competition_2017_Registration]])<br />
* Problem Submission: August 14, 2017 <br />
* Updates of Registered Tools: August 21, 2017 <br />
* Competition: September 5-6, 2017 (live data and results: [[Termination_Competition_2017_Data]])<br />
<br />
== Competition Categories ==<br />
<br />
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, ...)<br />
<br />
== Competition Procedure ==<br />
<br />
All participants in the same category will be run on a [http://www.termination-portal.org/wiki/Termination_Competition_Problem_Selection_Algorithm subset] of the existing problems of this category. The number of problems used in the competition is not fixed and will depend on the number of existing problems. The problem selection algorithm will be the same as in previous years [[Termination_Competition_Problem_Selection_Algorithm]]. The selection is made so that the whole competition will be executed live during the FSCD 2017. <br />
There might be modifications of the rules suggested by the organizer and decided by the SC.<br />
<br />
The wall-clock timeout will be 300 seconds, and 4 cores will be available (if a tool wants to use concurrent execution).<br />
The tools will be started in their directory and obtain<br />
<br />
* the problem file name on the command line,<br />
* and extra info from environment variables, cf. [[Termination Competition 2014 technical details]]<br />
<br />
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 [http://www.termination-portal.org/wiki/Termination_Competition_Certified_Categories_Competition certified] (see also the [http://cl-informatik.uibk.ac.at/software/cpf/ CPF-website]) and [http://cl-informatik.uibk.ac.at/users/georg/cbr/competition/ complexity] categories. See all existing [http://www.termination-portal.org/wiki/Category:Categories categories] for more details.<br />
<br />
For those problems where a correct answer is (partially) known, any contradictory answer will be penalized by -10 points.<br />
<!-- Moreover, those buggy systems may have the opportunity to provide a corrected version that will be run again after the end of the live execution (displaying the new results afterwards, but out of competition). --><br />
<br />
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).<br />
<br />
== Committees ==<br />
<br />
Steering Committee<br />
* Jürgen Giesl, RWTH Aachen, Germany<br />
* Albert Rubio (chair), UPC Barcelona, Spain<br />
* Johannes Waldmann, HTWK Leipzig, Germany<br />
* Akihisa Yamada, Universität Innsbruck, Austria<br />
<br />
Organizing Commmittee<br />
* Johannes Waldmann, HTWK Leipzig, Germany (StarExec)<br />
* Akihisa Yamada, Universität Innsbruck, Austria (CPF and TPDB)<br />
<br />
== Registration ==<br />
<br />
Participants must register<br />
<br />
* on Starexec (so you can upload and test your solver): enter your data at [https://www.starexec.org/starexec/public/registration.jsp StarExecRegistration], indicating the competition categories where they plan to enter tools and problems, and then upload their contributions to [http://www.starexec.org StarExec]<br />
<br />
* *and* with the competition's organizer, J. Waldmann (so I known what solver/configuration to use). Details will be announced here: [[Termination Competition 2017 Registration]]<br />
<br />
Note: if I (J. Waldmann) don't know you ("knowing" is roughly symmetrical), then I will ask you to specify: what termination tool you're working on, what competition categories you plan to take part in, your affiliation (in case you're a student, also the name of your advisor/research group leader). The email address you give in the registration should be your institutional one.<br />
<br />
We recommend to register early. After the deadline, access to [http://www.starexec.org StarExec] might be restricted. We need time to prepare the competition, and other competitions may be running in parallel.<br />
<br />
It is highly recommended that participants also subscribe to the [http://lists.lri.fr/mailman/listinfo/termtools termtools] mailing list, because that is where announcements will be made, and where discussion takes place.<br />
<br />
== StarExec Information ==<br />
<br />
this refers to StarExec in general, and not to Termination in particular.<br />
<br />
* [https://wiki.uiowa.edu/display/stardev/User+Guide user guide]<br />
* [https://www.tapatalk.com/groups/starexec/index.php announcements and discussion] ([https://www.tapatalk.com/groups/starexec/app.php/feed combined feed for recent messages])<br />
* [http://starexec.forumotion.com/ announcements and discussion] (discontinued, but contains some information that is still valid and not available elsewhere)<br />
<br />
== Technical Detail ==<br />
<br />
The competition will be running on [http://www.starexec.org/ 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.<br />
<br />
Competition data will be presented via [https://github.com/stefanvonderkrone/star-exec-presenter star-exec-presenter] - developed and running at HTWK Leipzig.<br />
<br />
Technical details about the execution platform (as of 2014) can be found [http://www.termination-portal.org/wiki/Termination_Competition_2014_technical_details here].<br />
<br />
<br />
== Contact ==<br />
<br />
To contact the steering committee of the termination competition, send an email to terminationcompetitionsc<at>lists.rwth-aachen.de. <br />
<br />
The competition organizers can be reached at johannes.waldmann<at>htwk-leipzig.de<br />
<br />
Send new problems for the competition to akihisa.yamada<at>uibk.ac.at<br />
<br />
== Changes with respect to 2016 ==<br />
<br />
These lists reflect the discussion in the community, and in the steering committee. Items are preliminary, and not officially binding. <br />
Please do not edit this list (unless you're in the SC). Instead, send proposals to termtools or terminationcompetitionsc mailing list,<br />
or create a new wiki page and put a link here.<br />
<br />
<!--<br />
Proposed changes: --><br />
<br />
* New category proposal: Certified [[Transition Systems|ITS]] Termination<br />
<!--<br />
Adopted changes: --><br />
<br />
<br />
<!--<br />
== TODO ==<br />
<br />
See [[Termination Competition 2016 TODO]]<br />
--></div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition_2017_Registration&diff=1754Termination Competition 2017 Registration2017-07-26T22:14:09Z<p>J.waldmann: /* Solvers */</p>
<hr />
<div>general information: [[Termination_Competition_2017]]<br />
<br />
== Test Runs ==<br />
<br />
not yet availabe<br />
<br />
<!--<br />
most recent public test run<br />
<br />
* [http://termcomp.imn.htwk-leipzig.de/competitions/164 all-in-one]<br />
--><br />
<br />
== Solvers ==<br />
<br />
For registering your solver, I (J. Waldmann) need the starexec ids of space, solver, and configuration,<br />
for each competition category that you want to take part in.<br />
<br />
For registration and updates, use the templates linked at the top of the [https://termcomp.imn.htwk-leipzig.de/registered/Y2017 registration page]. (Cf. also [https://termcomp.imn.htwk-leipzig.de/registered/Y2016 last year's registration])<br />
<br />
This helps me cut/pasting your data into the actual [https://github.com/jwaldmann/star-exec-presenter/blob/master/Presenter/Registration/Form_2017.hs#L90 code].<br />
<br />
I need read access to the space that contains your solver. Make that space public, or make me a member of the space.<br />
<br />
== Benchmarks ==<br />
<br />
Not yet available<br />
<br />
<!--<br />
(provisional) It is helpful when you put your benchmarks on starexec and announce the space id. <br />
Make that space readable for (at least) R. Thiemann and J. Waldmann. The earlier, the better - so I can start running tests.<br />
<br />
Benchmarks received:<br />
<br />
* 121 Integer Transition Systems (for complexity analysis) (A. Montoya) 184632<br />
* 28 cycle-SRS (H. Zantema) 184732<br />
* 226 one-rule SRS (M. Wenzel) 182728<br />
* 13 one-rule cycle-SRS (M. Wenzel) 182727<br />
* complexity of integer transition systems (KOAT syntax) (M. Brockschmidt) 184696<br />
* complexity of C programs (M. Sinn) 184687<br />
--></div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition_2017_Registration&diff=1753Termination Competition 2017 Registration2017-07-26T22:04:31Z<p>J.waldmann: /* Solvers */</p>
<hr />
<div>general information: [[Termination_Competition_2017]]<br />
<br />
== Test Runs ==<br />
<br />
not yet availabe<br />
<br />
<!--<br />
most recent public test run<br />
<br />
* [http://termcomp.imn.htwk-leipzig.de/competitions/164 all-in-one]<br />
--><br />
<br />
== Solvers ==<br />
<br />
For registering your solver, I (J. Waldmann) need the starexec ids of space, solver, and configuration,<br />
for each competition category that you want to take part in.<br />
<br />
For registration and updates, use the templates linked at the top of the [https://termcomp.imn.htwk-leipzig.de/termcomp-devel/registered/Y2017 registration page].<br />
<br />
This helps me cut/pasting your data into the actual [https://github.com/jwaldmann/star-exec-presenter/blob/master/Presenter/Registration/Form_2017.hs#L90 code].<br />
<br />
I need read access to the space that contains your solver. Make that space public, or make me a member of the space.<br />
<br />
== Benchmarks ==<br />
<br />
Not yet available<br />
<br />
<!--<br />
(provisional) It is helpful when you put your benchmarks on starexec and announce the space id. <br />
Make that space readable for (at least) R. Thiemann and J. Waldmann. The earlier, the better - so I can start running tests.<br />
<br />
Benchmarks received:<br />
<br />
* 121 Integer Transition Systems (for complexity analysis) (A. Montoya) 184632<br />
* 28 cycle-SRS (H. Zantema) 184732<br />
* 226 one-rule SRS (M. Wenzel) 182728<br />
* 13 one-rule cycle-SRS (M. Wenzel) 182727<br />
* complexity of integer transition systems (KOAT syntax) (M. Brockschmidt) 184696<br />
* complexity of C programs (M. Sinn) 184687<br />
--></div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition&diff=1739Termination Competition2017-06-01T09:55:10Z<p>J.waldmann: /* Competition Categories */</p>
<hr />
<div>= Annual International Termination Competition =<br />
<br />
During the 90's a number of new, powerful termination methods<br />
was developed. Thus, at the the beginning of the millennium<br />
many research groups started to develop [[:Category:Tools | tools for fully-automated termination analysis]].<br />
<br />
After a tool demonstration at the 2003 [[WST|Workshop on Termination]] in Valencia,<br />
the community decided to install an annual termination competition<br />
to spur the development of tools and new termination techniques.<br />
<br />
From 2004 till 2007, the competition organizer was Claude March&eacute;, [http://www.lri.fr/~marche/termination-competition/ Paris].<br />
From 2008 to 2013 the competition was run by Ren&eacute; Thiemann, [http://termcomp.uibk.ac.at Innsbruck].<br />
Since 2014, the competition organizer is Johannes Waldmann. Jobs are run on the [https://www.starexec.org/ Star Exec] platform at U Iowa. Results are aggregated and displayed at [http://nfa.imn.htwk-leipzig.de/termcomp/competition/20 HTWK Leipzig].<br />
<br />
== Upcoming Competitions ==<br />
<br />
<br />
<br />
== Competition Categories ==<br />
<br />
Currently, the competition features the following categories:<br />
* termination of [[String Rewriting|string]] and [[Term Rewriting|term rewriting]]<br />
* [[Logic_Programming|termination of logic programs]]<br />
* [[Certified_Termination|certified termination]] of string and term rewriting (since 2007)<br />
* [[Functional_Programming|termination of functional programs]] (since 2007)<br />
* [http://cl-informatik.uibk.ac.at/users/georg/cbr/competition/ complexity of rewrite systems] (since 2008)<br />
* [[Java_Bytecode|termination of Java Bytecode programs]] (since 2009)<br />
* [[Higher_Order|termination of higher order rewriting]] (since 2010)<br />
* [[C_Programs|termination of C programs]] (since 2014)<br />
* [[termination of integer transition systems]] (since 2014)<br />
* [[ITRS|integer term rewriting]] (since 2014)<br />
* [[C_Integer_Programs|termination of C integer programs]]<br />
* [[Cycle_Rewriting|termination of cycle rewriting]]<br />
<br />
<br />
Discussion is open and primarily happens on the termtools mailing list.<br />
Decisions will be made by votes among the [[Termination Competition Steering Committee]], with current members<br />
* [http://verify.rwth-aachen.de/giesl/ Jürgen Giesl], RWTH Aachen<br />
* [http://lim.univ-reunion.fr/staff/fred/ Frederic Mesnard], La Reunion <br />
* [https://www.cs.upc.edu/~albert/ Albert Rubio] (Chair), UPC Barcelona<br />
* [https://www.imn.htwk-leipzig.de/~waldmann/ Johannes Waldmann], HTWK Leipzig<br />
* [http://cl-informatik.uibk.ac.at/users/ayamada/ Akihisa Yamada], U. Innsbruck<br />
<br />
== Termination Problems Data Base ==<br />
<br />
The [[TPDB|Termination Problems Data Base]] collects all the problems used in the competitions. <br />
<br />
We welcome problem submissions from non-participants.<br />
<br />
== History of Termination Competitions ==<br />
<br />
The following competitions have taken place:<br />
<br />
* [[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/172 Results of Competition]. [http://www.cs.upc.edu/~albert/papers/termcomp2016_slides.pdf Presentation at WST]<br />
<br />
* [[Termination Competition 2015]], [http://nfa.imn.htwk-leipzig.de/termcomp-2015/competitions/4 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]<br />
<br />
* [[Termination Competition 2014]], [http://nfa.imn.htwk-leipzig.de/termcomp/competition/20 Results of Competition], [http://nfa.imn.htwk-leipzig.de/termcomp/competition/23 Results of Demonstration]<br />
<br />
* [[Termination Competition 2013]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=437763 Results][http://termcomp.uibk.ac.at/2013/competition2013.pdf Report]<br />
<br />
* [[Termination Competition 2012]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=362062 Results], [http://verify.rwth-aachen.de/giesl/competition2012.pdf Report]<br />
<br />
* [[Termination Competition 2011]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=230715 Results], [http://termcomp.uibk.ac.at/2011/competition2011.pdf Report]<br />
<br />
* [[Termination Competition 2010]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=185404 Results] <br />
<br />
* Termination Competition 2009 [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=101722 Results], [http://lists.lri.fr/pipermail/termtools/2009-November/000778.html Announcement]<br />
<br />
* [[Termination_Competition_2008|Termination Competition 2008]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=15991 Results], [http://www.imn.htwk-leipzig.de/~waldmann/talk/09/wst/ Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2007/ Termination Competition 2007], [http://www.imn.htwk-leipzig.de/~waldmann/talk/07/wst/competition/ Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2006/ Termination Competition 2006], [http://www.lri.fr/~marche/termination-competition/2006/reportCompetition2006.pdf Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2005/ Termination Competition 2005], [http://www.lri.fr/~marche/termination-competition/2005/TC.ppt Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2004/ Termination Competition 2004], [http://www.lri.fr/~marche/termination-competition/2004/slides-1jun2004.ps Report]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition_2016_Data&diff=1736Termination Competition 2016 Data2017-04-10T15:42:41Z<p>J.waldmann: </p>
<hr />
<div>[https://termcomp.imn.htwk-leipzig.de/competitions/172 Competition live data and results]<br />
(Note: display of time is [https://github.com/jwaldmann/star-exec-presenter/issues/125 wrong])<br />
<br />
== Timeline ==<br />
<br />
(all times are Obergurgl local time = CEST)<br />
<br />
* around 09:00 start Termination and Complexity Analysis of Programs<br />
* around 10:30 start Termination and Complexity Analysis of Rewriting<br />
* around 14:00 results should be available (probably a bit earlier)<br />
<br />
== Extra Information ==<br />
<br />
* [https://termcomp.imn.htwk-leipzig.de/registered/Y2016 participants]<br />
* [https://termcomp.imn.htwk-leipzig.de/combine/20/4/172 compare] current results to previous competitions (last column, provides options to merge solvers into "virtual best solver")<br />
<br />
== Comments ==<br />
<br />
* on organizational matters: write to the termtools mailing list [[Termtools]]<br />
* technical issues with the star-exec-presenter software: [https://github.com/jwaldmann/star-exec-presenter/issues]<br />
<br />
* comments by the organizer: [https://www.imn.htwk-leipzig.de/~waldmann/talk/16/termcomp]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition&diff=1735Termination Competition2017-03-08T22:04:24Z<p>J.waldmann: /* History of Termination Competitions */</p>
<hr />
<div>= Annual International Termination Competition =<br />
<br />
During the 90's a number of new, powerful termination methods<br />
was developed. Thus, at the the beginning of the millennium<br />
many research groups started to develop [[:Category:Tools | tools for fully-automated termination analysis]].<br />
<br />
After a tool demonstration at the 2003 [[WST|Workshop on Termination]] in Valencia,<br />
the community decided to install an annual termination competition<br />
to spur the development of tools and new termination techniques.<br />
<br />
From 2004 till 2007, the competition organizer was Claude March&eacute;, [http://www.lri.fr/~marche/termination-competition/ Paris].<br />
From 2008 to 2013 the competition was run by Ren&eacute; Thiemann, [http://termcomp.uibk.ac.at Innsbruck].<br />
Since 2014, the competition organizer is Johannes Waldmann. Jobs are run on the [https://www.starexec.org/ Star Exec] platform at U Iowa. Results are aggregated and displayed at [http://nfa.imn.htwk-leipzig.de/termcomp/competition/20 HTWK Leipzig].<br />
<br />
== Upcoming Competitions ==<br />
<br />
<br />
<br />
== Competition Categories ==<br />
<br />
Currently, the competition features the following categories:<br />
* termination of [[String Rewriting|string]] and [[Term Rewriting|term rewriting]]<br />
* [[Logic_Programming|termination of logic programs]]<br />
* [[Certified_Termination|certified termination]] of string and term rewriting (since 2007)<br />
* [[Functional_Programming|termination of functional programs]] (since 2007)<br />
* [http://cl-informatik.uibk.ac.at/users/georg/cbr/competition/ complexity of rewrite systems] (since 2008)<br />
* [[Java_Bytecode|termination of Java Bytecode programs]] (since 2009)<br />
* [[Higher_Order|termination of higher order rewriting]] (since 2010)<br />
* [[C_Programs|termination of C programs]] (since 2014)<br />
* [[termination of integer transition systems]] (since 2014)<br />
* [[ITRS|integer term rewriting]] (since 2014)<br />
* [[C_Integer_Programs|termination of C integer programs]]<br />
* [[Cycle_Rewriting|termination of cycle rewriting]]<br />
<br />
<br />
Discussion is open and primarily happens on the termtools mailing list.<br />
Decisions will be made by votes among the [[Termination Competition Steering Committee]].<br />
<br />
== Termination Problems Data Base ==<br />
<br />
The [[TPDB|Termination Problems Data Base]] collects all the problems used in the competitions. <br />
<br />
We welcome problem submissions from non-participants.<br />
<br />
== History of Termination Competitions ==<br />
<br />
The following competitions have taken place:<br />
<br />
* [[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/172 Results of Competition]<br />
<br />
* [[Termination Competition 2015]], [http://nfa.imn.htwk-leipzig.de/termcomp-2015/competitions/4 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]<br />
<br />
* [[Termination Competition 2014]], [http://nfa.imn.htwk-leipzig.de/termcomp/competition/20 Results of Competition], [http://nfa.imn.htwk-leipzig.de/termcomp/competition/23 Results of Demonstration]<br />
<br />
* [[Termination Competition 2013]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=437763 Results][http://termcomp.uibk.ac.at/2013/competition2013.pdf Report]<br />
<br />
* [[Termination Competition 2012]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=362062 Results], [http://verify.rwth-aachen.de/giesl/competition2012.pdf Report]<br />
<br />
* [[Termination Competition 2011]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=230715 Results], [http://termcomp.uibk.ac.at/2011/competition2011.pdf Report]<br />
<br />
* [[Termination Competition 2010]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=185404 Results] <br />
<br />
* Termination Competition 2009 [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=101722 Results], [http://lists.lri.fr/pipermail/termtools/2009-November/000778.html Announcement]<br />
<br />
* [[Termination_Competition_2008|Termination Competition 2008]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=15991 Results], [http://www.imn.htwk-leipzig.de/~waldmann/talk/09/wst/ Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2007/ Termination Competition 2007], [http://www.imn.htwk-leipzig.de/~waldmann/talk/07/wst/competition/ Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2006/ Termination Competition 2006], [http://www.lri.fr/~marche/termination-competition/2006/reportCompetition2006.pdf Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2005/ Termination Competition 2005], [http://www.lri.fr/~marche/termination-competition/2005/TC.ppt Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2004/ Termination Competition 2004], [http://www.lri.fr/~marche/termination-competition/2004/slides-1jun2004.ps Report]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition&diff=1734Termination Competition2017-03-08T22:02:20Z<p>J.waldmann: </p>
<hr />
<div>= Annual International Termination Competition =<br />
<br />
During the 90's a number of new, powerful termination methods<br />
was developed. Thus, at the the beginning of the millennium<br />
many research groups started to develop [[:Category:Tools | tools for fully-automated termination analysis]].<br />
<br />
After a tool demonstration at the 2003 [[WST|Workshop on Termination]] in Valencia,<br />
the community decided to install an annual termination competition<br />
to spur the development of tools and new termination techniques.<br />
<br />
From 2004 till 2007, the competition organizer was Claude March&eacute;, [http://www.lri.fr/~marche/termination-competition/ Paris].<br />
From 2008 to 2013 the competition was run by Ren&eacute; Thiemann, [http://termcomp.uibk.ac.at Innsbruck].<br />
Since 2014, the competition organizer is Johannes Waldmann. Jobs are run on the [https://www.starexec.org/ Star Exec] platform at U Iowa. Results are aggregated and displayed at [http://nfa.imn.htwk-leipzig.de/termcomp/competition/20 HTWK Leipzig].<br />
<br />
== Upcoming Competitions ==<br />
<br />
<br />
<br />
== Competition Categories ==<br />
<br />
Currently, the competition features the following categories:<br />
* termination of [[String Rewriting|string]] and [[Term Rewriting|term rewriting]]<br />
* [[Logic_Programming|termination of logic programs]]<br />
* [[Certified_Termination|certified termination]] of string and term rewriting (since 2007)<br />
* [[Functional_Programming|termination of functional programs]] (since 2007)<br />
* [http://cl-informatik.uibk.ac.at/users/georg/cbr/competition/ complexity of rewrite systems] (since 2008)<br />
* [[Java_Bytecode|termination of Java Bytecode programs]] (since 2009)<br />
* [[Higher_Order|termination of higher order rewriting]] (since 2010)<br />
* [[C_Programs|termination of C programs]] (since 2014)<br />
* [[termination of integer transition systems]] (since 2014)<br />
* [[ITRS|integer term rewriting]] (since 2014)<br />
* [[C_Integer_Programs|termination of C integer programs]]<br />
* [[Cycle_Rewriting|termination of cycle rewriting]]<br />
<br />
<br />
Discussion is open and primarily happens on the termtools mailing list.<br />
Decisions will be made by votes among the [[Termination Competition Steering Committee]].<br />
<br />
== Termination Problems Data Base ==<br />
<br />
The [[TPDB|Termination Problems Data Base]] collects all the problems used in the competitions. <br />
<br />
We welcome problem submissions from non-participants.<br />
<br />
== History of Termination Competitions ==<br />
<br />
The following competitions have taken place:<br />
<br />
* [[Termination_Competition_2016|Termination Competition 2016]] affiliated with [http://cl-informatik.uibk.ac.at/events/wst-2016/ WST (Workshop on Termination)].<br />
<br />
* [[Termination Competition 2015]], [http://nfa.imn.htwk-leipzig.de/termcomp-2015/competitions/4 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]<br />
<br />
* [[Termination Competition 2014]], [http://nfa.imn.htwk-leipzig.de/termcomp/competition/20 Results of Competition], [http://nfa.imn.htwk-leipzig.de/termcomp/competition/23 Results of Demonstration]<br />
<br />
* [[Termination Competition 2013]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=437763 Results][http://termcomp.uibk.ac.at/2013/competition2013.pdf Report]<br />
<br />
* [[Termination Competition 2012]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=362062 Results], [http://verify.rwth-aachen.de/giesl/competition2012.pdf Report]<br />
<br />
* [[Termination Competition 2011]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=230715 Results], [http://termcomp.uibk.ac.at/2011/competition2011.pdf Report]<br />
<br />
* [[Termination Competition 2010]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=185404 Results] <br />
<br />
* Termination Competition 2009 [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=101722 Results], [http://lists.lri.fr/pipermail/termtools/2009-November/000778.html Announcement]<br />
<br />
* [[Termination_Competition_2008|Termination Competition 2008]], [http://termcomp.uibk.ac.at/termcomp/competition/competitionSummary.seam?comp=15991 Results], [http://www.imn.htwk-leipzig.de/~waldmann/talk/09/wst/ Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2007/ Termination Competition 2007], [http://www.imn.htwk-leipzig.de/~waldmann/talk/07/wst/competition/ Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2006/ Termination Competition 2006], [http://www.lri.fr/~marche/termination-competition/2006/reportCompetition2006.pdf Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2005/ Termination Competition 2005], [http://www.lri.fr/~marche/termination-competition/2005/TC.ppt Report]<br />
* [http://www.lri.fr/~marche/termination-competition/2004/ Termination Competition 2004], [http://www.lri.fr/~marche/termination-competition/2004/slides-1jun2004.ps Report]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=WST&diff=1733WST2017-03-08T22:00:28Z<p>J.waldmann: </p>
<hr />
<div>The International Workshop on Termination (WST) brings together, in an informal setting, researchers interested in all aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop also provides a ground for cross-fertilisation of ideas from term rewriting and from the different programming language communities.<br />
<br />
Upcoming events:<br />
<br />
*<br />
<br />
Information about previous workshops can be found online:<br />
* [http://cl-informatik.uibk.ac.at/events/wst-2016/ 15th International Workshop on Termination] at [http://cl-informatik.uibk.ac.at/events/cla-2016/ Computational Logic in the Alps], Obergurgl, Austria, September 5-7, 2016.<br />
* [http://vsl2014.at/wst/ 14th International Workshop on Termination] during [http://vsl2014.at/ Vienna Summer of Logic], Vienna, Austria, July 17-18, 2014<br />
* Joint Workshop on Termination [http://www.imn.htwk-leipzig.de/WST2013/ WST2013] and on Foundational and Practical Aspects of Resource Analysis [http://fopara2013.cs.unibo.it/ FOPARA], Bertinoro, Italy, August 29-31, 2013<br />
* [http://cl-informatik.uibk.ac.at/users/georg/events/wst2012 12th International Workshop on Termination, Obergurgl, February 19-23, 2012]<br />
* [http://imada.sdu.dk/~petersk/WST2010/ 11th International Workshop on Termination, Edinburgh, 2010]<br />
* [http://www.imn.htwk-leipzig.de/wst09/ 10th International Workshop on Termination, Leipzig, 2009]<br />
* [http://www.lsv.ens-cachan.fr/rdp07/wst.html 9th International Workshop on Termination, Paris, 2007]<br />
* [http://www.easychair.org/FLoC-06/WST.html 8th International Workshop on Terminaton, Seattle, 2006]<br />
* [http://www-i2.informatik.rwth-aachen.de/WST04/ 7th International Workshop on Terminaton, Aachen, 2004]<br />
* [http://www.dsic.upv.es/~rdp03/wst/ 6th International Workshop on Terminaton, Valencia, 2003]<br />
* [http://www.cs.tau.ac.il/~nachumd/wst/index.html 5th International Workshop on Terminaton, Utrecht, 2001]<br />
* [http://verify.rwth-aachen.de/giesl/WST99.html 4th International Workshop on Terminaton, Dagstuhl, 1999]<br />
* [http://www-i2.informatik.rwth-aachen.de/giesl/WST97/main.html 3rd International Workshop on Termination, Ede, 1997]<br />
* 2nd International Workshop on Termination, La Bresse, 1995<br />
* 1st International Workshop on Termination, St. Andrews, 1993<br />
Independently from WST, there are meetings on Certified Termination : [[WScT]]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition_2016_Data&diff=1731Termination Competition 2016 Data2016-09-07T11:29:12Z<p>J.waldmann: </p>
<hr />
<div>[http://termcomp.imn.htwk-leipzig.de/competitions/172 Competition live data and results]<br />
(Note: display of time is [https://github.com/jwaldmann/star-exec-presenter/issues/125 wrong])<br />
<br />
== Timeline ==<br />
<br />
(all times are Obergurgl local time = CEST)<br />
<br />
* around 09:00 start Termination and Complexity Analysis of Programs<br />
* around 10:30 start Termination and Complexity Analysis of Rewriting<br />
* around 14:00 results should be available (probably a bit earlier)<br />
<br />
== Extra Information ==<br />
<br />
* [http://termcomp.imn.htwk-leipzig.de/registered/Y2016 participants]<br />
* [http://termcomp.imn.htwk-leipzig.de/combine/20/4/172 compare] current results to previous competitions (last column, provides options to merge solvers into "virtual best solver")<br />
<br />
== Comments ==<br />
<br />
* on organizational matters: write to the termtools mailing list [[Termtools]]<br />
* technical issues with the star-exec-presenter software: [https://github.com/jwaldmann/star-exec-presenter/issues]<br />
<br />
* comments by the organizer: [http://www.imn.htwk-leipzig.de/~waldmann/talk/16/termcomp]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition_2016_Data&diff=1730Termination Competition 2016 Data2016-09-07T11:28:59Z<p>J.waldmann: /* Comments */</p>
<hr />
<div>[http://termcomp.imn.htwk-leipzig.de/competitions/172 Competition live data and results]<br />
<br />
(Note: display of time is [https://github.com/jwaldmann/star-exec-presenter/issues/125 wrong])<br />
<br />
== Timeline ==<br />
<br />
(all times are Obergurgl local time = CEST)<br />
<br />
* around 09:00 start Termination and Complexity Analysis of Programs<br />
* around 10:30 start Termination and Complexity Analysis of Rewriting<br />
* around 14:00 results should be available (probably a bit earlier)<br />
<br />
== Extra Information ==<br />
<br />
* [http://termcomp.imn.htwk-leipzig.de/registered/Y2016 participants]<br />
* [http://termcomp.imn.htwk-leipzig.de/combine/20/4/172 compare] current results to previous competitions (last column, provides options to merge solvers into "virtual best solver")<br />
<br />
== Comments ==<br />
<br />
* on organizational matters: write to the termtools mailing list [[Termtools]]<br />
* technical issues with the star-exec-presenter software: [https://github.com/jwaldmann/star-exec-presenter/issues]<br />
<br />
* comments by the organizer: [http://www.imn.htwk-leipzig.de/~waldmann/talk/16/termcomp]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition_2016_Data&diff=1728Termination Competition 2016 Data2016-09-06T07:43:43Z<p>J.waldmann: </p>
<hr />
<div>[http://termcomp.imn.htwk-leipzig.de/competitions/172 Competition live data and results]<br />
<br />
(Note: display of time is [https://github.com/jwaldmann/star-exec-presenter/issues/125 wrong])<br />
<br />
== Timeline ==<br />
<br />
(all times are Obergurgl local time = CEST)<br />
<br />
* around 09:00 start Termination and Complexity Analysis of Programs<br />
* around 10:30 start Termination and Complexity Analysis of Rewriting<br />
* around 14:00 results should be available (probably a bit earlier)<br />
<br />
== Extra Information ==<br />
<br />
* [http://termcomp.imn.htwk-leipzig.de/registered/Y2016 participants]<br />
* [http://termcomp.imn.htwk-leipzig.de/combine/20/4/172 compare] current results to previous competitions (last column, provides options to merge solvers into "virtual best solver")<br />
<br />
== Comments ==<br />
<br />
* on organizational matters: write to the termtools mailing list [[Termtools]]<br />
* technical issues with the star-exec-presenter software: [https://github.com/jwaldmann/star-exec-presenter/issues]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition_2016_Data&diff=1727Termination Competition 2016 Data2016-09-06T07:35:50Z<p>J.waldmann: /* Timeline */</p>
<hr />
<div>[http://termcomp.imn.htwk-leipzig.de/competitions/172 live data]<br />
<br />
== Timeline ==<br />
<br />
(all times are Obergurgl local time = CEST)<br />
<br />
* around 09:00 start Termination and Complexity Analysis of Programs<br />
* around 10:30 start Termination and Complexity Analysis of Rewriting<br />
* around 14:00 results should be available (probably a bit earlier)<br />
<br />
== Extra Information ==<br />
<br />
* [http://termcomp.imn.htwk-leipzig.de/registered/Y2016 participants]<br />
* [http://termcomp.imn.htwk-leipzig.de/combine/20/4/172 compare] current results to previous competitions (last column, provides options to merge solvers into "virtual best solver")<br />
<br />
== Comments ==<br />
<br />
* on organizational matters: write to the termtools mailing list [[Termtools]]<br />
* technical issues with the star-exec-presenter software: [https://github.com/jwaldmann/star-exec-presenter/issues]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition_2016_Data&diff=1726Termination Competition 2016 Data2016-09-06T07:17:19Z<p>J.waldmann: </p>
<hr />
<div>[http://termcomp.imn.htwk-leipzig.de/competitions/172 live data]<br />
<br />
== Timeline ==<br />
<br />
(all times are Obergurgl local time = CEST)<br />
<br />
* around 09:00 start Termination and Complexity Analysis of Programs<br />
* around 11:00 start Termination and Complexity Analysis of Rewriting<br />
* around 14:00 results should be available<br />
<br />
== Extra Information ==<br />
<br />
* [http://termcomp.imn.htwk-leipzig.de/registered/Y2016 participants]<br />
* [http://termcomp.imn.htwk-leipzig.de/combine/20/4/172 compare] current results to previous competitions (last column, provides options to merge solvers into "virtual best solver")<br />
<br />
== Comments ==<br />
<br />
* on organizational matters: write to the termtools mailing list [[Termtools]]<br />
* technical issues with the star-exec-presenter software: [https://github.com/jwaldmann/star-exec-presenter/issues]</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition_2016_Data&diff=1725Termination Competition 2016 Data2016-09-05T22:47:21Z<p>J.waldmann: </p>
<hr />
<div>[http://termcomp.imn.htwk-leipzig.de/competitions/172 live data]<br />
<br />
== Timeline ==<br />
<br />
(all times are Obergurgl local time = CEST)<br />
<br />
* around 09:00 start Termination and Complexity Analysis of Programs<br />
* around 11:00 start Termination and Complexity Analysis of Rewriting<br />
* around 14:00 results should be available<br />
<br />
== Extra Information ==<br />
<br />
* [http://termcomp.imn.htwk-leipzig.de/registered/Y2016 participants]<br />
* [http://termcomp.imn.htwk-leipzig.de/combine/20/4/172 compare] current results to previous competitions (last column, provides options to merge solvers into "virtual best solver")</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition_2016_Data&diff=1724Termination Competition 2016 Data2016-09-05T21:18:17Z<p>J.waldmann: </p>
<hr />
<div>Once the competition is started, an URL for live data will be inserted here.<br />
<br />
* [http://termcomp.imn.htwk-leipzig.de/registered/Y2016 participants]<br />
<br />
== Timeline ==<br />
<br />
(all times are Obergurgl local time = CEST)<br />
<br />
* around 09:00 start Termination and Complexity Analysis of Programs<br />
* around 11:00 start Termination and Complexity Analysis of Rewriting<br />
* around 14:00 results should be available</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition_2016_Data&diff=1723Termination Competition 2016 Data2016-09-05T21:17:56Z<p>J.waldmann: </p>
<hr />
<div>Once the competition is started, an URL for live data will be inserted here.<br />
<br />
* [http://termcomp.imn.htwk-leipzig.de/registered/Y2016 participant]<br />
<br />
== Timeline ==<br />
<br />
(all times are Obergurgl local time = CEST)<br />
<br />
* around 09:00 start Termination and Complexity Analysis of Programs<br />
* around 11:00 start Termination and Complexity Analysis of Rewriting<br />
* around 14:00 results should be available</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition_2016_Data&diff=1722Termination Competition 2016 Data2016-09-05T21:15:45Z<p>J.waldmann: /* Timeline */</p>
<hr />
<div>Once the competition is started, an URL for live data will be inserted here.<br />
<br />
== Timeline ==<br />
<br />
(all times are Obergurgl local time = CEST)<br />
<br />
* around 09:00 start Termination and Complexity Analysis of Programs<br />
* around 11:00 start Termination and Complexity Analysis of Rewriting<br />
* around 14:00 results should be available</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_Competition_2016_Data&diff=1721Termination Competition 2016 Data2016-09-05T21:12:34Z<p>J.waldmann: Created page with "== Timeline == (all times are CEST) * around 09:00 start Termination and Complexity Analysis of Programs * around 11:00 start Termination and Complexity Analysis of Rewritin..."</p>
<hr />
<div>== Timeline ==<br />
<br />
(all times are CEST)<br />
<br />
* around 09:00 start Termination and Complexity Analysis of Programs<br />
* around 11:00 start Termination and Complexity Analysis of Rewriting<br />
* results should be available around 14:00</div>J.waldmannhttp://termination-portal.org/mediawiki/index.php?title=Termination_and_Complexity_Competition_2016&diff=1720Termination and Complexity Competition 20162016-09-05T21:06:58Z<p>J.waldmann: /* Dates */</p>
<hr />
<div>In 2016, the Termination and Complexity Competition <!-- ([http://lists.lri.fr/pipermail/termtools/2015-June/000984.html Call for Participation]) --> will be affiliated with the [http://cl-informatik.uibk.ac.at/events/wst-2016/ 15th International Workshop on Termination] and it will take place "live" during the workshop. Participants may give a short presentation of their tool during the competition session at the workshop. The competition will be run on the [http://www.starexec.org/ StarExec platform].<br />
<br />
== Dates ==<br />
<br />
* Tool Registration: July 31, 2016 (detail: [[Termination_Competition_2016_Registration]])<br />
* Problem Submission: August 14, 2016 <br />
* Updates of Registered Tools: August 21, 2016 <br />
* Competition: September 6, 2016 (live data and results: [[Termination_Competition_2016_Data]])<br />
<br />
== Competition Categories ==<br />
<br />
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, ...)<br />
<br />
== Competition Procedure ==<br />
<br />
All participants in the same category will be run on a [http://www.termination-portal.org/wiki/Termination_Competition_Problem_Selection_Algorithm subset] of the existing problems of this category. The number of problems used in the competition is not fixed and will depend on the number of existing problems. The problem selection algorithm will be the same as in previous years [[Termination_Competition_Problem_Selection_Algorithm]]. The selection is made so that the whole competition will be executed live during the competition session of WST 2016. <br />
There might be modifications of the rules suggested by the organizer and decided by the SC.<br />
<br />
The wall-clock timeout will be 30 seconds, and 4 cores will be available (if a tool wants to use concurrent execution). A longer timeout for selected categories might be possible and has to be negotiated with the participants of that category.<br />
<br />
The tools will be started in their directory and obtain<br />
<br />
* the problem file name on the command line,<br />
* and extra info from environment variables, cf. [[Termination Competition 2014 technical details]]<br />
<br />
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 [http://www.termination-portal.org/wiki/Termination_Competition_Certified_Categories_Competition certified] (see also the [http://cl-informatik.uibk.ac.at/software/cpf/ CPF-website]) and [http://cl-informatik.uibk.ac.at/users/georg/cbr/competition/ complexity] categories. See all existing [http://www.termination-portal.org/wiki/Category:Categories categories] for more details.<br />
<br />
For those problems where a correct answer is (partially) known, any contradictory answer will be penalized by -10 points.<br />
<!-- Moreover, those buggy systems may have the opportunity to provide a corrected version that will be run again after the end of the live execution (displaying the new results afterwards, but out of competition). --><br />
<br />
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).<br />
<br />
== Committees ==<br />
<br />
Steering Committee<br />
* Jürgen Giesl, RWTH Aachen, Germany<br />
* Frederic Mesnard, Université de la Réunion, France<br />
* Albert Rubio (chair), UPC Barcelona, Spain<br />
* René Thiemann, Universität Innsbruck, Austria<br />
* Johannes Waldmann, HTWK Leipzig, Germany<br />
<br />
Organizing Commmittee<br />
* Johannes Waldmann, HTWK Leipzig, Germany (StarExec)<br />
* René Thiemann, Universität Innsbruck, Austria (CPF)<br />
* Akihisa Yamada, Universität Innsbruck, Austria (TPDB)<br />
<br />
== Registration ==<br />
<br />
Participants must register<br />
<br />
* on Starexec (so you can upload and test your solver): enter your data at [https://www.starexec.org/starexec/public/registration.jsp StarExecRegistration], indicating the competition categories where they plan to enter tools and problems, and then upload their contributions to [http://www.starexec.org StarExec]<br />
<br />
* *and* with the competition's organizer, J. Waldmann (so I known what solver/configuration to use). Details will be announced here: [[Termination Competition 2016 Registration]]<br />
<br />
Note: if I (J. Waldmann) don't know you ("knowing" is roughly symmetrical), then I will ask you to specify: what termination tool you're working on, what competition categories you plan to take part in, your affiliation (in case you're a student, also the name of your advisor/research group leader). The email address you give in the registration should be your institutional one.<br />
<br />
We recommend to register early. After the deadline, access to [http://www.starexec.org StarExec] might be restricted. We need time to prepare the competition, and other competitions may be running in parallel.<br />
<br />
It is highly recommended that participants also subscribe to the [http://lists.lri.fr/mailman/listinfo/termtools termtools] mailing list, because that is where announcements will be made, and where discussion takes place.<br />
<br />
== StarExec Information ==<br />
<br />
this refers to StarExec in general, and not to Termination in particular.<br />
<br />
* [https://wiki.uiowa.edu/display/stardev/User+Guide user guide]<br />
* [http://starexec.lefora.com/directory announcements and discussion] ([http://starexec.lefora.com/feed/get/type/rss/source/domain/id/280028 combined feed for recent messages])<br />
* [http://starexec.forumotion.com/ announcements and discussion] (discontinued, but contains some information that is still valid and not available elsewhere)<br />
<br />
== Technical Detail ==<br />
<br />
The competition will be running on [http://www.starexec.org/ 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.<br />
<br />
Competition data will be presented via [https://github.com/stefanvonderkrone/star-exec-presenter star-exec-presenter] - developed and running at HTWK Leipzig.<br />
<br />
Technical details about the execution platform (as of 2014) can be found [http://www.termination-portal.org/wiki/Termination_Competition_2014_technical_details here].<br />
<br />
<br />
== Contact ==<br />
<br />
To contact the steering committee of the termination competition, send an email to terminationcompetitionsc<at>lists.rwth-aachen.de. <br />
<br />
The competition organizers can be reached at johannes.waldmann<at>htwk-leipzig.de<br />
<br />
Send new problems for the competition to akihisa.yamada<at>uibk.ac.at<br />
<br />
== Changes with respect to 2015 ==<br />
<br />
These lists reflect the discussion in the community, and in the steering committee. Items are preliminary, and not officially binding. <br />
Please do not edit this list (unless you're in the SC). Instead, send proposals to termtools or terminationcompetitionsc mailing list,<br />
or create a new wiki page and put a link here.<br />
<br />
<!--<br />
Proposed changes: --><br />
<br />
Adopted changes:<br />
<br />
* The CPF version is in the process of being updated from version 2.3 to version 2.4. This transition consists mainly of incremental changes. The details of the changes are documented in the [http://cl2-informatik.uibk.ac.at/rewriting/mercurial.cgi/CPF CPF repository log]. The only non-incremental change is that now there is a dedicated input format for termination problems modulo AC, which before have been encoded as relative termination problems.<br />
<br />
<br />
<!--<br />
== TODO ==<br />
<br />
See [[Termination Competition 2015 TODO]]<br />
--></div>J.waldmann