cl-banner

The Termination and Complexity Competition

Jürgen Giesl, Albert Rubio, Christian Sternagel, Johannes Waldmann, Akihisa Yamada

25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science 11429, pp. 155 – 166, 2019.

Abstract

The termination and complexity competition (termCOMP) focuses on automated termination and complexity analysis for various
kinds of programming paradigms, including categories for term rewriting, integer transition systems, imperative programming, logic programming, and functional programming. In all categories, the competition also welcomes the participation of tools providing certifiable output. The goal of the competition is to demonstrate the power and advances of the state-of-the-art tools in each of these areas.

 

  PDF |    doi:10.1007/978-3-030-17502-3_10 |  © Open Access (CC BY 4.0)

BibTeX 

@inproceedings{JGARCSJWAY-TACAS19,
author = "Jürgen Giesl and Albert Rubio and Christian Sternagel and Johannes Waldmann and
Akihisa Yamada",
title = "The Termination and Complexity Competition",
booktitle = "Proceedings of the 25th International Conference on Tools and Algorithms for the
Construction and Analysis of Systems",
editor = "Tomáš Vojnar and Lijun Zhang",
series = "Lecture Notes in Computer Science",
volume = 11429,
pages = "156--166",
year = 2019,
doi = "10.1007/978-3-030-17502-3_10"
}
Nach oben scrollen