Termination proofs and the length of derivations
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
Termination proofs by multiset path orderings imply primitive recursive derivation lengths
Theoretical Computer Science - Selected papers of the Second International Conference on algebraic and logic programming, Nancy, France, October 1–3, 1990
Term rewriting and all that
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Modular termination proofs for rewriting using dependency pairs
Journal of Symbolic Computation
Termination Proofs by Context-Dependent Interpretations
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Algorithms with polynomial interpretation termination proof
Journal of Functional Programming
Mechanically Proving Termination Using Polynomial Interpretations
Journal of Automated Reasoning
Mechanizing and Improving Dependency Pairs
Journal of Automated Reasoning
Tyrolean termination tool: Techniques and features
Information and Computation
On tree automata that certify termination of left-linear term rewriting systems
Information and Computation
SAT solving for termination analysis with polynomial interpretations
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Complexity analysis by rewriting
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Derivational complexity of knuth-bendix orders revisited
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Complexity, Graphs, and the Dependency Pair Method
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Dependency Pairs and Polynomial Path Orders
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
The Derivational Complexity Induced by the Dependency Pair Method
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Derivational complexity is an invariant cost model
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Cdiprover3: a tool for proving derivational complexities of term rewriting systems
ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
POP and semantic labeling using SAT
ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
Joint spectral radius theory for automated complexity analysis of rewrite systems
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
A dependency pair framework for innermost complexity analysis of term rewrite systems
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Course of value distinguishes the intentionality of programming languages
Proceedings of the Second Symposium on Information and Communication Technology
Complexity invariance of real interpretations
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Complexity analysis by graph rewriting
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
A linear operational semantics for termination and complexity analysis of ISO prolog
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs
Proceedings of the 14th symposium on Principles and practice of declarative programming
Synthesis of sup-interpretations: A survey
Theoretical Computer Science
Hi-index | 0.00 |
In this paper, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. This method is easy to implement, but significantly extends the analytic power of existing direct methods. Our findings extend the class of TRSs whose linear or quadratic runtime complexity can be detected automatically. We provide ample numerical data for assessing the viability of the method.