Abstract
The termination competition focuses on automated termination analysis for all kinds of programming paradigms, including categories for term rewriting, imperative programming, logic programming, and functional programming. Moreover, the competition also features categories for automated complexity analysis. In all categories, the competition also welcomes the participation of tools providing certified proofs. The goal of the termination competition is to demonstrate the power of the leading tools in each of these areas.
Cite
CITATION STYLE
Giesl, J., Mesnard, F., Rubio, A., Thiemann, R., & Waldmann, J. (2015). Termination competition (TermCOMP 2015). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9195, pp. 105–108). Springer Verlag. https://doi.org/10.1007/978-3-319-21401-6_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
