Pages that link to "Item:Q851142"
From MaRDI portal
The following pages link to Mechanically proving termination using polynomial interpretations (Q851142):
Displayed 12 items.
- Mechanically proving termination using polynomial interpretations (Q851142) (← links)
- Tyrolean termination tool: techniques and features (Q876042) (← links)
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting (Q2502172) (← links)
- Modular and incremental automated termination proofs (Q2583289) (← links)
- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures (Q3522011) (← links)
- Proving Quadratic Derivational Complexities Using Context Dependent Interpretations (Q3522024) (← links)
- Automated Implicit Computational Complexity Analysis (System Description) (Q3541694) (← links)
- Automated Complexity Analysis Based on the Dependency Pair Method (Q3541717) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
- Complexity Analysis by Rewriting (Q5458433) (← links)
- Termination Analysis of Logic Programs Based on Dependency Graphs (Q5504590) (← links)
- Search Techniques for Rational Polynomial Orders (Q5505493) (← links)