Difference between revisions of "Termination Portal"

From Termination-Portal.org
Jump to navigationJump to search
 
(21 intermediate revisions by 6 users not shown)
Line 1: Line 1:
 +
<!---'''The Termination Portal is moving.'''  Editing has been disabled for everyone to avoid data loss.
 +
----
 +
--->
 +
 
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.
 
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).
 
Research in termination analysis offers many challenges both in theory (mathematical logic, proof theory) and practice (software development, formal methods).
Line 8: Line 12:
 
[[:Category:Tools|Tools]] (information about tools for automated termination analysis), and
 
[[:Category:Tools|Tools]] (information about tools for automated termination analysis), and
 
[[:Category:Bibtex|References]] (publications related to termination analysis).  
 
[[:Category:Bibtex|References]] (publications related to termination analysis).  
Additionally, the portal provide information about past and future [[WST|workshops]] and [[Termination Competition|competitions]].
+
Additionally, the portal provides information about past and future [[WST|workshops]] and [[Termination Competition|competitions]].
 +
 
 +
Have [[Suggestions]] to improve this web resource?
 +
- How to [[Contribute]].
  
 
=Recent News=
 
=Recent News=
<dpl>
+
* [[Termination Competition 2024]]
 +
* [[Termination Competition 2023]]
 +
* [[19th International Workshop on Termination]]
 +
* [[Termination Competition 2022]]
 +
<DynamicPageList>
 
   category=News
 
   category=News
 
   shownamespace=false
 
   shownamespace=false
Line 21: Line 32:
 
   table      =class="wikitable",Caption,Date,Text
 
   table      =class="wikitable",Caption,Date,Text
 
   tablerow    =|%%
 
   tablerow    =|%%
</dpl>
+
</DynamicPageList>
 
Older news entries can be found on the [[:Category:News|news page]].
 
Older news entries can be found on the [[:Category:News|news page]].
  
 +
<!--
 
=New Publications=
 
=New Publications=
<dpl>
+
<DynamicPageList>
 
   category=BibtexNews
 
   category=BibtexNews
 
   shownamespace=false
 
   shownamespace=false
Line 35: Line 47:
 
   table      =class="wikitable",Name,Content
 
   table      =class="wikitable",Name,Content
 
   tablerow    =|%%
 
   tablerow    =|%%
</dpl>
+
</DynamicPageList>
 +
-->

Latest revision as of 13:37, 16 January 2024


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

Older news entries can be found on the news page.