Automated Amortised Resource Analysis for Term Rewrite Systems

Based on earlier work on amortised resource analysis, we establish a novel automated amortised resource analysis for term rewrite systems. The method is presented in an inference system akin to a type system and gives rise to polynomial bounds on the innermost runtime complexity of the analysed term...

Full description

Saved in:
Bibliographic Details
Published inFunctional and Logic Programming Vol. 10818; pp. 214 - 229
Main Authors Moser, Georg, Schneckenreither, Manuel
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 01.01.2018
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Amortised complexity
Analysis of algorithms
Automation
Term rewriting
Types
Online AccessGet full text
ISBN3319906852
9783319906850
ISSN0302-9743
1611-3349
DOI10.1007/978-3-319-90686-7_14

Cover

More Information
Summary:Based on earlier work on amortised resource analysis, we establish a novel automated amortised resource analysis for term rewrite systems. The method is presented in an inference system akin to a type system and gives rise to polynomial bounds on the innermost runtime complexity of the analysed term rewrite system. Our analysis does not restrict the input rewrite system in any way. This facilitates integration in a general framework for resource analysis of programs. In particular, we have implemented the method and integrated it into our tool .
Bibliography:This research is partly supported by DARPA/AFRL contract number FA8750-17-C-088.
ISBN:3319906852
9783319906850
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-90686-7_14