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.
J. Giesl—This author is supported by the Deutsche Forschungsgemeinschaft (DFG) grant GI 274/6-1. A. Rubio—This author is supported by the Spanish MINECO under the grant TIN2013-45732-C4-3-P (project DAMAS). R. Thiemann—This author is supported by the Austrian Science Fund (FWF) project Y757.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Giesl, J., Mesnard, F., Rubio, A., Thiemann, R., Waldmann, J. (2015). Termination Competition (termCOMP 2015). In: Felty, A., Middeldorp, A. (eds) Automated Deduction - CADE-25. CADE 2015. Lecture Notes in Computer Science(), vol 9195. Springer, Cham. https://doi.org/10.1007/978-3-319-21401-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-21401-6_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21400-9
Online ISBN: 978-3-319-21401-6
eBook Packages: Computer ScienceComputer Science (R0)