Pages that link to "Item:Q5901572"

The following pages link to Rewriting Techniques and Applications (Q5901572):

Displaying 33 items.

• A combination framework for complexity (Q276251) (← links)
• Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
• Termination of string rewriting proved automatically (Q850497) (← links)
• Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
• Tyrolean termination tool: techniques and features (Q876042) (← links)
• Mechanizing and improving dependency pairs (Q877836) (← links)
• Matrix interpretations for proving termination of term rewriting (Q928655) (← links)
• Context-sensitive dependency pairs (Q989290) (← links)
• Increasing interpretations (Q1044231) (← links)
• Dependence by reverse regular rule (Q1090030) (← links)
• The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors (Q1635507) (← links)
• Modular termination proofs for rewriting using dependency pairs (Q1864874) (← links)
• Multi-dimensional interpretations for termination of term rewriting (Q2055861) (← links)
• Tuple interpretations for termination of term rewriting (Q2102931) (← links)
• The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques (Q2228436) (← links)
• Relative termination via dependency pairs (Q2360875) (← links)
• Guessing singular dependencies (Q2437325) (← links)
• Enhancing dependency pair method using strong computability in simply-typed term rewriting (Q2460908) (← links)
• Automating the dependency pair method (Q2486583) (← links)
• The size-change principle and dependency pairs for termination of term rewriting (Q2573795) (← links)
• Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting (Q2945713) (← links)
• Dependent pairs (Q3011109) (← links)
• Reducing Relative Termination to Dependency Pair Problems (Q3454090) (← links)
• Local Termination (Q3636830) (← links)
• Response to “Differential Dependencies Revisited” (Q5012575) (← links)
• Termination of constructor systems (Q5055852) (← links)
• Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
• Context-Sensitive Dependency Pairs (Q5385994) (← links)
• Termination of Narrowing Using Dependency Pairs (Q5504664) (← links)
• Increasing Interpretations (Q5505499) (← links)
• Termination by absence of infinite chains of dependency pairs (Q5878910) (← links)
• Automated Deduction – CADE-19 (Q5900708) (← links)
• A static higher-order dependency pair framework (Q6070806) (← links)