Innermost Termination of Rewrite Systems by Labeling

DOI10.1016/j.entcs.2008.03.050zbMath1279.68121OpenAlexW2028113860MaRDI QIDQ2873673

Aart Middeldorp, René Thiemann

Publication date: 24 January 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.03.050

zbMATH Keywords

terminationterm rewritinginnermost terminationpredictive labelingsemantic labeling

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)

Related Items

Root-Labeling, Search Techniques for Rational Polynomial Orders

Uses Software

• Tyrolean
• TPA

Cites Work

• Unnamed Item
• Tyrolean termination tool: techniques and features
• Mechanizing and improving dependency pairs
• Termination of term rewriting using dependency pairs
• TPA: Termination Proved Automatically
• Predictive Labeling
• Predictive Labeling with Dependency Pairs Using SAT
• Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems