Pages that link to "Item:Q1978641"
From MaRDI portal
The following pages link to Termination of term rewriting using dependency pairs (Q1978641):
Displaying 50 items.
- 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)
- Real or natural number interpretation and their effect on complexity (Q2346989) (← links)
- Analyzing innermost runtime complexity of term rewriting by dependency pairs (Q2351155) (← links)
- Relative termination via dependency pairs (Q2360875) (← links)
- SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
- Enhancing dependency pair method using strong computability in simply-typed term rewriting (Q2460908) (← links)
- Automating the dependency pair method (Q2486583) (← links)
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting (Q2502172) (← links)
- Termination orders for three-dimensional rewriting (Q2504386) (← links)
- The size-change principle and dependency pairs for termination of term rewriting (Q2573795) (← links)
- Modular and incremental automated termination proofs (Q2583289) (← links)
- Operational semantics of resolution and productivity in Horn clause logic (Q2628299) (← links)
- Modular and incremental proofs of AC-termination (Q2643544) (← links)
- (Q2778873) (← links)
- Using context-sensitive rewriting for proving innermost termination of rewriting (Q2808236) (← links)
- Lazy rewriting and context-sensitive rewriting (Q2841298) (← links)
- Approximations for strategies and termination (Q2843601) (← links)
- Outermost ground termination (Q2851054) (← links)
- Termination criteria for DPO transformations with injective matches (Q2867892) (← links)
- Improving the context-sensitive dependency graph (Q2867962) (← links)
- Proving termination of context-sensitive rewriting with MU-TERM (Q2867963) (← links)
- Innermost termination of rewrite systems by labeling (Q2873673) (← links)
- Decidability of innermost termination and context-sensitive termination for semi-constructor term rewriting systems (Q2873675) (← links)
- Static slicing of rewrite systems (Q2873792) (← links)
- Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting (Q2945713) (← links)
- Compression of rewriting systems for termination analysis (Q2958378) (← links)
- A Lambda-Free Higher-Order Recursive Path Order (Q2988386) (← 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)
- Certification of Termination Proofs Using CeTA (Q3183545) (← links)
- A Finite Representation of the Narrowing Space (Q3453648) (← links)
- Reducing Relative Termination to Dependency Pair Problems (Q3454090) (← links)
- Linear Integer Arithmetic Revisited (Q3454126) (← links)
- Modular Termination of Basic Narrowing (Q3522005) (← links)
- Effectively Checking the Finite Variant Property (Q3522010) (← links)
- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures (Q3522011) (← links)
- Maximal Termination (Q3522012) (← links)
- Usable Rules for Context-Sensitive Rewrite Systems (Q3522013) (← links)
- Arctic Termination ...Below Zero (Q3522019) (← links)
- Root-Labeling (Q3522028) (← links)
- Deciding Innermost Loops (Q3522030) (← links)
- Normalization of Infinite Terms (Q3522036) (← links)
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (Q3540124) (← links)
- The Computability Path Ordering: The End of a Quest (Q3540166) (← links)
- Automated Implicit Computational Complexity Analysis (System Description) (Q3541694) (← links)
- Automated Complexity Analysis Based on the Dependency Pair Method (Q3541717) (← links)
