Pages that link to "Item:Q2573795"

The following pages link to The size-change principle and dependency pairs for termination of term rewriting (Q2573795):

Displaying 12 items.

• Tyrolean termination tool: techniques and features (Q876042) (← links)
• Mechanizing and improving dependency pairs (Q877836) (← links)
• A complexity tradeoff in ranking-function termination proofs (Q1006896) (← links)
• Fast offline partial evaluation of logic programs (Q2437798) (← links)
• Enhancing dependency pair method using strong computability in simply-typed term rewriting (Q2460908) (← links)
• The size-change principle and dependency pairs for termination of term rewriting (Q2573795) (← links)
• The Strength of the SCT Criterion (Q2988827) (← links)
• Size-based termination of higher-order rewriting (Q4577817) (← links)
• (Q5089009) (← links)
• A SAT-Based Approach to Size Change Termination with Global Ranking Functions (Q5458329) (← links)
• Termination Analysis of Logic Programs Based on Dependency Graphs (Q5504590) (← links)
• Formal verification of termination criteria for first-order recursive functions (Q6149593) (← links)