Root-Labeling

DOI10.1007/978-3-540-70590-1_23zbMath1145.68453OpenAlexW2911543830MaRDI QIDQ3522028

Christian Sternagel, Aart Middeldorp

Publication date: 28 August 2008

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70590-1_23

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (4)

Size-based termination of higher-order rewriting ⋮ Using linear constraints for logic program termination analysis ⋮ Unnamed Item ⋮ CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates

Cites Work

• Unnamed Item
• Unnamed Item
• Mechanizing and improving dependency pairs
• Counterexamples to termination for the direct sum of term rewriting systems
• Termination of term rewriting using dependency pairs
• Automating the dependency pair method
• Innermost Termination of Rewrite Systems by Labeling
• TPA: Termination Proved Automatically
• Predictive Labeling
• Predictive Labeling with Dependency Pairs Using SAT
• SAT Solving for Termination Analysis with Polynomial Interpretations
• Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems
• Matrix Interpretations for Proving Termination of Term Rewriting
• Transforming termination by self-labelling
• Theory and Applications of Satisfiability Testing
• Termination by Quasi-periodic Interpretations
• Logic for Programming, Artificial Intelligence, and Reasoning

This page was built for publication: Root-Labeling