Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity

DOI10.4230/LIPICS.RTA.2011.235zbMath1236.68140OpenAlexW2101939505MaRDI QIDQ5389084

Georg Moser, Andreas Schnabl

Publication date: 24 April 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_c911.html

zbMATH Keywords

complexitymultiple recursive functionsDP framework

Mathematics Subject Classification ID

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

Uses Software

• Tyrolean

This page was built for publication: Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity