Name
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 certificationof modular complexity proofs and incorporated it into CeTA. Wereport 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 inexisting complexity tools. |
Year | Venue | Field |
|---|---|---|
2015 | RTA | USable,Dependency pairs,Discrete mathematics,Computer science,Tuple,Algorithm,Theoretical computer science,Mathematical proof,Rewriting,Modular design,Certification |
DocType | Citations | PageRank |
Conference | 4 | 0.51 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Avanzini | 1 | 106 | 11.10 |
| Christian Sternagel | 2 | 202 | 27.60 |
| René Thiemann | 3 | 984 | 69.38 |