The following pages link to (Q2778874):
Displaying 12 items.
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Real or natural number interpretation and their effect on complexity (Q2346989) (← links)
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting (Q2502172) (← links)
- A context-based approach to proving termination of evaluation (Q2805157) (← links)
- On the Computational Content of Termination Proofs (Q3195706) (← links)
- Proving Quadratic Derivational Complexities Using Context Dependent Interpretations (Q3522024) (← links)
- Automated Complexity Analysis Based on the Dependency Pair Method (Q3541717) (← links)
- A proof-theoretic study of abstract termination principles (Q5216340) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
- Interactive Termination Proofs Using Termination Cores (Q5747661) (← links)
- Analyzing Innermost Runtime Complexity Through Tuple Interpretations (Q6118746) (← links)
