Complexity of acyclic term graph rewriting

DOI10.4230/LIPICS.FSCD.2016.10MaRDI QIDQ5369475zbMATH OpenOpenAlexFDO

Authors Martin Avanzini, Georg Moser

Publication date 17 October 2017

Full work available at URL https://dblp.uni-trier.de/db/conf/rta/fscd2016.html#AvanziniM16

zbMATH Keywords

complexity analysisgraph rewritingprogram analysis

Mathematics Subject Classification ID

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

Recommendations

• Complexity analysis by graph rewriting
• Essentials of term graph rewriting
• Modular aspects of term graph rewriting
• scientific article; zbMATH DE number 1361503
• Modularity of termination in term graph rewriting

Cited in

(6)

• Estimation of expressions' complexities for two-terminal directed acyclic graphs
• Complexity analysis by graph rewriting
• Running Time Complexity of Printing an Acyclic Automaton
• Kruskal's tree theorem for acyclic term graphs
• Data-driven runtime complexity analysis
• On complexity of confluence and Church-Rosser proofs

This page was built for publication: Complexity of acyclic term graph rewriting

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