Journal of Symbolic Computation
Handbook of theoretical computer science (vol. B)
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
A new recursion-theoretic characterization of the polytime functions
Computational Complexity
Computability and complexity: from a programming perspective
Computability and complexity: from a programming perspective
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
Generalizing Cook's Transformation to Imperative Stack Programs
Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science
Linear Types and Non Size-Increasing Polynomial Time Computation
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
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
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Automated Implicit Computational Complexity Analysis (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Sup-interpretations, a semantic method for static analysis of program resources
ACM Transactions on Computational Logic (TOCL)
Dependency Pairs and Polynomial Path Orders
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Complexity analysis by rewriting
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
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
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
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
Complexity analysis by graph rewriting
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
A polytime functional language from light linear logic
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
A short introduction to implicit computational complexity
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
| Hi-index | 0.00 |
We study termination proofs in order to (i) determine computational complexity of programs and (ii) generate efficient programs from the complexity analysis. For this, we construct a termination ordering, called light multiset path ordering (LMPO), which is a restriction of the multiset path ordering. We establish that the class of first order functional programs on lists which is terminating by LMPO characterises exactly the functions computable in polynomial time.