Automated amortised resource analysis for term rewrite systems

DOI10.1007/978-3-319-90686-7_14MaRDI QIDQ1648888zbMATH OpenOpenAlexFDO

Authors Georg Moser, Manuel Schneckenreither

Publication date 9 July 2018

Full work available at URL https://arxiv.org/abs/1811.09071

zbMATH Keywords

amortised complexityanalysis of algorithmsautomationterm rewritingtypes

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42) Analysis of algorithms (68W40)

Recommendations

• Multivariate amortised resource analysis for term rewrite systems
• Amortised resource analysis and typed polynomial interpretations
• Complexity analysis for term rewriting by integer transition systems
• Analyzing runtime complexity via innermost runtime complexity
• Automated Complexity Analysis Based on Context-Sensitive Rewriting

Cited in

(7)

• Preface: Special issue on automatic resource bound analysis
• Using term-graph rewriting models to analyse relative space efficiency
• Amortised resource analysis and typed polynomial interpretations
• Multivariate amortised resource analysis for term rewrite systems
• Type-based analysis of logarithmic amortised complexity
• Analysing parallel complexity of term rewriting
• ATLAS: automated amortised complexity analysis of self-adjusting data structures

This page was built for publication: Automated amortised resource analysis for term rewrite systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1648888)