Termination proofs and the length of derivations
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
Term rewriting and all that
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Polynomial-time computation via local inference relations
ACM Transactions on Computational Logic (TOCL)
Linear Types and Non Size-Increasing Polynomial Time Computation
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Algorithms with polynomial interpretation termination proof
Journal of Functional Programming
Mechanizing and Improving Dependency Pairs
Journal of Automated Reasoning
On tree automata that certify termination of left-linear term rewriting systems
Information and Computation
Matrix Interpretations for Proving Termination of Term Rewriting
Journal of Automated Reasoning
Characterizations of polynomial complexity classes with a better intensionality
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Automated Implicit Computational Complexity Analysis (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Automated Complexity Analysis Based on the Dependency Pair Method
IJCAR '08 Proceedings of the 4th international joint conference on Automated 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
Automating the dependency pair method
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Max/plus tree automata for termination of term rewriting
Acta Cybernetica
Automated termination analysis for logic programs with cut*
Theory and Practice of Logic Programming
Automated termination proofs for haskell by term rewriting
ACM Transactions on Programming Languages and Systems (TOPLAS)
Revisiting matrix interpretations for polynomial derivational complexity of term rewriting
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
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
| Hi-index | 0.00 |
We present a modular framework to analyze the innermost runtime complexity of term rewrite systems automatically. Our method is based on the dependency pair framework for termination analysis. In contrast to previous work, we developed a direct adaptation of successful termination techniques from the dependency pair framework in order to use them for complexity analysis. By extensive experimental results, we demonstrate the power of our method compared to existing techniques.