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.
- 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
Older news entries can be found on the news page.