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.
CitationGiesl, J., Mesnard, F., Rubio, A., Thiemann, R., Waldmann, J. Termination competition (termCOMP 2015). A: International Conference on Automated Deduction. "Automated Deduction CADE-25: 25th International Conference on Automated Deduction, Berlin, Germany, August 1-7, 2015: proceedings". Berlín: Springer, 2015, p. 105-108.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org