Usable Rules for Context-Sensitive Rewrite Systems

DOI10.1007/978-3-540-70590-1_9zbMath1145.68447OpenAlexW2168896930MaRDI QIDQ3522013

Raúl Gutiérrez, Salvador Lucas, Xavier Urbain

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_9

zbMATH Keywords

terminationterm rewritingdependency pairs

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (3)

Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting ⋮ Usable Rules for Context-Sensitive Rewrite Systems ⋮ Context-sensitive dependency pairs

Uses Software

• Tyrolean
• MU-TERM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proving termination of context-sensitive rewriting by transformation
• Tyrolean termination tool: techniques and features
• Mechanizing and improving dependency pairs
• Generalized sufficient conditions for modular termination of rewriting
• Context-sensitive rewriting strategies
• Modular termination proofs for rewriting using dependency pairs
• Termination of term rewriting using dependency pairs
• Proving operational termination of membership equational programs
• Modular and incremental automated termination proofs
• Improving the Context-sensitive Dependency Graph
• Proving Termination of Context-Sensitive Rewriting with MU-TERM
• Usable Rules for Context-Sensitive Rewrite Systems
• Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
• SAT Solving for Termination Analysis with Polynomial Interpretations
• Proving innermost normalisation automatically
• Context-Sensitive Dependency Pairs
• Transformation techniques for context-sensitive rewrite systems
• Logic for Programming, Artificial Intelligence, and Reasoning

This page was built for publication: Usable Rules for Context-Sensitive Rewrite Systems