LIPIcs.RTA.2015.334.pdf
- Filesize: 0.69 MB
- 16 pages
Document
Inferring Lower Bounds for Runtime Complexity
Authors
-
Part of:
Volume:
26th International Conference on Rewriting Techniques and Applications (RTA 2015)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Rewriting Techniques and Applications (RTA) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2015-06-18
Cite AsGet BibTex
Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, and Thomas Ströder. Inferring Lower Bounds for Runtime Complexity. In 26th International Conference on Rewriting Techniques and Applications (RTA 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 36, pp. 334-349, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
https://doi.org/10.4230/LIPIcs.RTA.2015.334
https://doi.org/10.4230/LIPIcs.RTA.2015.334
Abstract
We present the first approach to deduce lower bounds for innermost runtime complexity of term rewrite systems (TRSs) automatically. Inferring lower runtime bounds is useful to detect bugs and to complement existing techniques that compute upper complexity
bounds. The key idea of our approach is to generate suitable families of rewrite sequences of a TRS and to find a relation between the length of such a rewrite sequence and the size of the first term in the sequence. We implemented our approach in
the tool AProVE and evaluated it by extensive experiments.
Keywords
- Term Rewriting
- Runtime Complexity
- Lower Bounds
- Induction
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads