Termination proofs and the length of derivations
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
A new recursion-theoretic characterization of the polytime functions
Computational Complexity
Term rewriting and all that
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Analysing the implicit complexity of programs
Information and Computation - Special issue: ICC '99
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
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
Proofs of termination of rewrite systems for polytime functions
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Proving and disproving termination of higher-order functions
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
POP and semantic labeling using SAT
ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
Characterising space complexity classes via Knuth-Bendix orders
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
A dependency pair framework for innermost complexity analysis of term rewrite systems
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Complexity analysis by graph rewriting
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
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 show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify polynomial runtime complexity of term rewrite systems and the polytime computability of the functions computed. The established techniques have been implemented and we provide ample experimental data to assess the new method.