Termination Competition (termCOMP 2015)
Jürgen Giesl, Frédéric Mesnard, Albert Rubio, René Thiemann, and Johannes WaldmannProceedings of the 25th International Conference on Automated Deduction (CADE-25), Lecture Notes in Computer Science 9195, pp. 105 – 108, 2015.
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.
BibTeX
@inproceedings{GMRTW15,
author = "J{\"u}rgen Giesl and Fr{\'e}d{\'e}ric Mesnard and Albert Rubio
and Ren{\'e} Thiemann and Johannes Waldmann",
title = "Termination Competition (term{COMP} 2015)",
booktitle = "25th International {C}onference on {A}utomated {D}eduction
(CADE-25)",
series = "Lecture Notes in Computer Science",
volume = 9195,
pages = {105--108},
publisher = {Springer},
year = 2015
}