Certification of Complexity Proofs using CeTA - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Certification of Complexity Proofs using CeTA

Résumé

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.
Fichier principal
Vignette du fichier
paper.pdf (609.05 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01252000 , version 1 (07-01-2016)

Identifiants

Citer

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⟩
233 Consultations
56 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More