Algorithms with polynomial interpretation termination proof
From MaRDI portal
Recommendations
- Verification, Model Checking, and Abstract Interpretation
- Mechanically proving termination using polynomial interpretations
- scientific article; zbMATH DE number 1348481
- Algorithmic polynomials
- Algorithmic Polynomials
- scientific article; zbMATH DE number 2018591
- scientific article; zbMATH DE number 1296286
- Foundations of Software Science and Computation Structures
- Termination of polynomial loops
- Polynomial algorithms in computer algebra
Cited in
(29)- Applications and extensions of context-sensitive rewriting
- Derivational complexity and context-sensitive Rewriting
- A new order-theoretic characterisation of the polytime computable functions
- Real or natural number interpretation and their effect on complexity
- Characterizing polynomial time complexity of stream programs using interpretations
- Analyzing innermost runtime complexity of term rewriting by dependency pairs
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
- A combination framework for complexity
- Higher-order interpretations and program complexity
- Intensional properties of polygraphs
- On quasi-interpretations, blind abstractions and implicit complexity
- Complexity of conditional term rewriting
- A Short Introduction to Implicit Computational Complexity
- Proving Quadratic Derivational Complexities Using Context Dependent Interpretations
- Automated Implicit Computational Complexity Analysis (System Description)
- Automated Complexity Analysis Based on the Dependency Pair Method
- scientific article; zbMATH DE number 1342224 (Why is no real title available?)
- scientific article; zbMATH DE number 1348481 (Why is no real title available?)
- Complexity analysis of precedence terminating infinite graph rewrite systems
- Formalizing termination proofs under polynomial quasi-interpretations
- A dependency pair framework for innermost complexity analysis of term rewrite systems
- Quasi-interpretations. A way to control resources
- Complexity Analysis by Rewriting
- Analyzing Innermost Runtime Complexity Through Tuple Interpretations
- On basic feasible functionals and the interpretation method
- A characterization of basic feasible functionals through higher-order rewriting and tuple interpretations
- Small term reachability and related problems for terminating term rewriting systems
- On the complexity of the small term reachability problem for terminating term rewriting systems
- Mechanically proving termination using polynomial interpretations
This page was built for publication: Algorithms with polynomial interpretation termination proof
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2740985)
