Deciding Innermost Loops

DOI10.1007/978-3-540-70590-1_25zbMath1145.68457MaRDI QIDQ3522030

Jürgen Giesl, Peter Schneider-Kamp, René Thiemann

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_25

Mathematics Subject Classification ID

68Q42: Grammars and rewriting systems

Related Items

From Outermost Termination to Innermost Termination, Loops under Strategies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Termination of string rewriting proved automatically
• Tyrolean termination tool: techniques and features
• Mechanizing and improving dependency pairs
• Overlap closures do not suffice for termination of general term rewriting systems
• Termination of rewriting
• Unification of infinite sets of terms schematized by primal grammars
• Termination of term rewriting using dependency pairs
• On Proving Uniform Termination and Restricted Termination of Rewriting Systems
• Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
• Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator
• Term Rewriting and All That
• Frontiers of Combining Systems
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Logic for Programming, Artificial Intelligence, and Reasoning