Pages that link to "Item:Q851142"
From MaRDI portal
The following pages link to Mechanically proving termination using polynomial interpretations (Q851142):
Displaying 24 items.
- SAT modulo linear arithmetic for solving polynomial constraints (Q438576) (← links)
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations (Q485843) (← links)
- Mechanically proving termination using polynomial interpretations (Q851142) (← links)
- Tyrolean termination tool: techniques and features (Q876042) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Derivational complexity and context-sensitive Rewriting (Q2069872) (← links)
- The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques (Q2228436) (← 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)
- CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates (Q3094178) (← 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)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (Q5191108) (← links)
- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic (Q5191109) (← 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)
- Monotonicity Criteria for Polynomial Interpretations over the Naturals (Q5747787) (← links)
- Type-based analysis of logarithmic amortised complexity (Q5875895) (← links)
- Analyzing Innermost Runtime Complexity Through Tuple Interpretations (Q6118746) (← links)
