On Lexicographic Termination Ordering with Space Bound Certifications
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
A Characterisation of Multiply Recursive Functions with Higman's Lemma
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Termination Proofs by Context-Dependent Interpretations
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Recursive Derivational Length Bounds for Confluent Term Rewrite Systems
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Analysing the implicit complexity of programs
Information and Computation - Special issue: ICC '99
An upper bound on the derivational complexity of Knuth--Bendix orderings
Information and Computation - Special issue: ICC '99
Algorithms with polynomial interpretation termination proof
Journal of Functional Programming
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Automated Complexity Analysis Based on the Dependency Pair Method
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
The Derivational Complexity Induced by the Dependency Pair Method
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Reduction relations for monoid semirings
Journal of Symbolic Computation
Relating derivation lengths with the slow-growing hierarchy directly
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Efficient first order functional program interpreter with time bound certifications
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Complexity analysis by rewriting
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
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
Quasi-interpretations a way to control resources
Theoretical Computer Science
Derivational complexity of knuth-bendix orders revisited
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
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
Quasi-interpretations and small space bounds
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
The derivational complexity of string rewriting systems
Theoretical Computer Science
Synthesis of sup-interpretations: A survey
Theoretical Computer Science
Hi-index | 0.00 |