Skip to Main content Skip to Navigation
Conference papers

Certification of Complexity Proofs using CeTA

Martin Avanzini 1, 2, * Christian Sternagel 3 René Thiemann 3
* Corresponding author
2 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
Abstract : Nowadays certification is widely employed by automated termination tools for term rewriting, where certifiers support most available techniques. In complexity analysis, the situation is quite different. Although tools support certification in principle, current certifiers implement only the most basic technique, namely, suitably tamed versions of reduction orders. As a consequence, only a small fraction of the proofs generated by state-of-the-art complexity tools can be certified. To improve upon this situation, we formalized a framework for the certification of modular complexity proofs and incorporated it into CeTA. We report on this extension and present the newly supported techniques (match-bounds, weak dependency pairs, dependency tuples, usable rules, and usable replacement maps), resulting in a significant increase in the number of certifiable complexity proofs. During our work we detected conflicts in theoretical results as well as bugs in existing complexity tools.
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Martin Avanzini Connect in order to contact the contributor
Submitted on : Thursday, January 7, 2016 - 10:08:03 AM
Last modification on : Friday, October 30, 2020 - 12:04:03 PM
Long-term archiving on: : Friday, April 8, 2016 - 1:12:49 PM


Files produced by the author(s)




Martin Avanzini, Christian Sternagel, René Thiemann. Certification of Complexity Proofs using CeTA. 26th International Conference on Rewriting Techniques and Applications, Jun 2015, Warsaw, Poland. ⟨10.4230/LIPIcs.RTA.2015.23⟩. ⟨hal-01252000⟩



Les métriques sont temporairement indisponibles