Termination Portal
Termination is a fundamental topic in computer science. While classical results state the undecidability of various termination problems, automated methods have successfully been developed that prove termination or non-termination in practical cases. Research in termination analysis offers many challenges both in theory (mathematical logic, proof theory) and practice (software development, formal methods).
This portal aims to provide the research community with up-to-date information about the field of termination analysis. The main sections are People (information about researchers in termination analysis), News (information about events and new publications), Tools (information about tools for automated termination analysis), and References (publications related to termination analysis). Additionally, the portal provides information about past and future workshops and competitions.
Have Suggestions to improve this web resource? - How to Contribute.
Recent News
- Termination Competition 2021
- Termination Competition 2020
- Termination Competition 2019
- Workshop on Termination 2020
- Termination and Complexity Competition 2018
- Termination and Complexity Competition 2017
- Termination and Complexity Competition 2016
- Workshop on Termination 2016: September 5-7 at Computational Logic in the Alps
- Termination Competition 2015
- Termination Competition 2014 is part of FLoC Olympics
- Workshop on Termination 2014 at Vienna Summer of Logic
- Full TPDB run, December 2013
- Workshop on Termination 2013: August 28 - 31
- Termination Competition 2013: June 24 - June 26
- Termination Competition 2012: June 26 - June 29
- Complexity Wiki Moved
- Plan for complete run (all tools, all problems)
- Plan for Termination Competition 2012
- Termination Competition 2011: May 30 - June 1
- Termination Competition 2010 in July
- Complexity Wiki Updated
- Proposal - Rename XTC
- Termination Competition 2009 in December
- Certification Problem Format
- Certified non-standard termination
- XTC Format Specification
- Outermost Category
- Logic Programming Category of the Termination Competition
- Complexity Category
- Termination Competition Meeting, Hagenberg, 15th July 2008
- Details for WScT08 Leipzig May 17-19
- Adding References
- Domain Registered
- Domain name
- Termination Portal Online
Older news entries can be found on the news page.
