Pages that link to "Item:Q877836"
From MaRDI portal
The following pages link to Mechanizing and improving dependency pairs (Q877836):
Displaying 38 items.
- Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
- Uncurrying for termination and complexity (Q352959) (← links)
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- Characterizing and proving operational termination of deterministic conditional term rewriting systems (Q710679) (← links)
- KBO orientability (Q846165) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Termination of narrowing via termination of rewriting (Q969619) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- Match-bounds revisited (Q1041044) (← links)
- Increasing interpretations (Q1044231) (← links)
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors (Q1635507) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- Multi-dimensional interpretations for termination of term rewriting (Q2055861) (← links)
- An automated approach to the Collatz conjecture (Q2055879) (← links)
- Derivational complexity and context-sensitive Rewriting (Q2069872) (← links)
- Tuple interpretations for termination of term rewriting (Q2102931) (← links)
- Term orderings for non-reachability of (conditional) rewriting (Q2104512) (← links)
- Pattern eliminating transformations (Q2119103) (← links)
- The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques (Q2228436) (← links)
- Using well-founded relations for proving operational termination (Q2303238) (← links)
- Automatic generation of logical models with AGES (Q2305421) (← links)
- Analyzing innermost runtime complexity of term rewriting by dependency pairs (Q2351155) (← links)
- Relative termination via dependency pairs (Q2360875) (← links)
- Analyzing program termination and complexity automatically with \textsf{AProVE} (Q2362493) (← links)
- SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
- Fast offline partial evaluation of logic programs (Q2437798) (← links)
- Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting (Q2808236) (← links)
- Innermost Termination of Rewrite Systems by Labeling (Q2873673) (← links)
- Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting (Q2945713) (← links)
- (Q2980977) (← links)
- Dependency Triples for Improving Termination Analysis of Logic Programs with Cut (Q3003493) (← links)
- Proving Termination Properties with mu-term (Q3067476) (← 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)
- Generalized and Formalized Uncurrying (Q3172898) (← links)
- Reducing Relative Termination to Dependency Pair Problems (Q3454090) (← links)
- (Q5089009) (← links)
- An automated approach to the Collatz conjecture (Q6103589) (← links)
