Naaf, M. and Frohn, F. and Brockschmidt, M. and Fuhs, Carsten and Giesl, J. (2017) Complexity analysis for term rewriting by integer transition systems. In: Dixon, C. and Finger, M. (eds.) Frontiers of Combining Systems: 11th International Symposium, FroCoS 2017, Brasília, Brazil, September 27-29, 2017, Proceedings. Lecture Notes in Artificial Intelligence 10483. Springer. ISBN 9783319661667.
![[img]](https://eprints.bbk.ac.uk/style/images/fileicons/text.png) |
Text
FroCoS17-trs-via-int-complexity.pdf - Author's Accepted Manuscript Restricted to Repository staff only Download (479kB) | Request a copy |
Abstract
We present a new method to infer upper bounds on the innermost runtime complexity of term rewrite systems (TRSs), which benefits from recent advances on complexity analysis of integer transition systems (ITSs). To this end, we develop a transformation from TRSs to a generalized notion of ITSs with (possibly non-tail) recursion. To analyze their complexity, we introduce a modular technique which allows us to use existing tools for standard ITSs in order to infer complexity bounds for our generalized ITSs. The key idea of our technique is a summarization method that allows us to analyze components of the transition system independently. We implemented our contributions in the tool AProVE, and our experiments show that one can now infer bounds for significantly more TRSs than with previous state-of-the-art tools for term rewriting.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Carsten Fuhs |
| Date Deposited: | 02 Oct 2017 14:58 |
| Last Modified: | 09 Aug 2023 12:42 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/19182 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
