Usable Rules for Context-Sensitive Rewrite Systems
From MaRDI portal
Publication:3522013
DOI10.1007/978-3-540-70590-1_9zbMATH Open1145.68447OpenAlexW2168896930MaRDI QIDQ3522013FDOQ3522013
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
Recommendations
Cites Work
- Proving termination of context-sensitive rewriting with MU-TERM
- Modular termination proofs for rewriting using dependency pairs
- Termination of term rewriting using dependency pairs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proving operational termination of membership equational programs
- Logic for Programming, Artificial Intelligence, and Reasoning
- Tyrolean termination tool: techniques and features
- Mechanizing and improving dependency pairs
- SAT Solving for Termination Analysis with Polynomial Interpretations
- Context-sensitive rewriting strategies
- Proving innermost normalisation automatically
- Generalized sufficient conditions for modular termination of rewriting
- Improving the context-sensitive dependency graph
- Context-Sensitive Dependency Pairs
- Title not available (Why is that?)
- Transformation techniques for context-sensitive rewrite systems
- Modular and incremental automated termination proofs
- Proving termination of context-sensitive rewriting by transformation
- Usable Rules for Context-Sensitive Rewrite Systems
- Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
Cited In (5)
Uses Software
This page was built for publication: Usable Rules for Context-Sensitive Rewrite Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522013)
