Difference between revisions of "Termination Portal"
(→News) |
|||
| Line 20: | Line 20: | ||
order=descending | order=descending | ||
addfirstcategorydate=true | addfirstcategorydate=true | ||
| + | </dpl> | ||
| + | |||
| + | =New Publications= | ||
| + | <dpl> | ||
| + | category=BibtexNews | ||
| + | shownamespace=false | ||
| + | count=10 | ||
| + | ordermethod=lastedit | ||
| + | order=descending | ||
| + | includepage=%0[100] | ||
| + | format =,,\n, | ||
| + | table =border=1,Name,Content | ||
| + | tablerow =|%% | ||
</dpl> | </dpl> | ||
Revision as of 18:27, 29 March 2008
Welcome
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 provide information about past and future workshops and competitions.
Recent News
<dpl>
category=News shownamespace=false count=10 ordermethod=lastedit order=descending addfirstcategorydate=true
</dpl>
New Publications
<dpl>
category=BibtexNews shownamespace=false count=10 ordermethod=lastedit order=descending includepage=%0[100] format =,,\n, table =border=1,Name,Content tablerow =|%%
</dpl>
