Pages that link to "Item:Q2486583"
From MaRDI portal
The following pages link to Automating the dependency pair method (Q2486583):
Displaying 32 items.
- Uncurrying for termination and complexity (Q352959) (← links)
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- KBO orientability (Q846165) (← links)
- Tyrolean termination tool: techniques and features (Q876042) (← links)
- Elimination transformations for associative-commutative rewriting systems (Q877834) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Matrix interpretations for proving termination of term rewriting (Q928655) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- Match-bounds revisited (Q1041044) (← links)
- Increasing interpretations (Q1044231) (← links)
- Term orderings for non-reachability of (conditional) rewriting (Q2104512) (← links)
- Pattern eliminating transformations (Q2119103) (← links)
- Analyzing innermost runtime complexity of term rewriting by dependency pairs (Q2351155) (← links)
- SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
- Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting (Q2808236) (← links)
- Dependency Triples for Improving Termination Analysis of Logic Programs with Cut (Q3003493) (← links)
- CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates (Q3094178) (← links)
- Harnessing First Order Termination Provers Using Higher Order Dependency Pairs (Q3172889) (← links)
- Certification of Termination Proofs Using CeTA (Q3183545) (← links)
- Maximal Termination (Q3522012) (← links)
- Root-Labeling (Q3522028) (← links)
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (Q3540124) (← links)
- Proving Termination of Integer Term Rewriting (Q3636817) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving (Q5191111) (← links)
- Beyond Dependency Graphs (Q5191112) (← links)
- A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems (Q5200041) (← links)
- Termination Analysis of Logic Programs Based on Dependency Graphs (Q5504590) (← links)
- Search Techniques for Rational Polynomial Orders (Q5505493) (← links)
- Increasing Interpretations (Q5505499) (← links)
- Monotonicity Criteria for Polynomial Interpretations over the Naturals (Q5747787) (← links)
- The Derivational Complexity Induced by the Dependency Pair Method (Q5902127) (← links)
