Termination proofs by context-dependent interpretations
From MaRDI portal
Recommendations
- Termination proofs and the length of derivations
- Termination proofs for ground rewrite systems -- interpretations and derivational complexity
- Proving Quadratic Derivational Complexities Using Context Dependent Interpretations
- Termination of term rewriting by interpretation
- Termination of rewrite systems by elementary interpretations
Cited in
(20)- Increasing interpretations
- Automatic synthesis of logical models for order-sorted first-order theories
- Real or natural number interpretation and their effect on complexity
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
- A context-based approach to proving termination of evaluation
- Complexity analysis of term rewriting based on matrix and context dependent interpretations
- On the Computational Content of Termination Proofs
- Proving Quadratic Derivational Complexities Using Context Dependent Interpretations
- Automated Complexity Analysis Based on the Dependency Pair Method
- scientific article; zbMATH DE number 4110084 (Why is no real title available?)
- Polynomial interpretations and the complexity of algorithms
- Termination proofs and the length of derivations
- A proof-theoretic study of abstract termination principles
- Polynomials over the reals in proofs of termination : from theory to practice
- Increasing Interpretations
- Interactive Termination Proofs Using Termination Cores
- Termination proofs for ground rewrite systems -- interpretations and derivational complexity
- Analyzing Innermost Runtime Complexity Through Tuple Interpretations
- Linear termination is undecidable
- Proving termination of context-sensitive rewriting by transformation
This page was built for publication: Termination proofs by context-dependent interpretations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2778874)
