Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting
From MaRDI portal
Publication:2808236
DOI10.1016/j.entcs.2009.07.055zbMath1337.68147OpenAlexW2119937562MaRDI QIDQ2808236
Beatriz Alarcón, Salvador Lucas
Publication date: 20 May 2016
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.2009.07.055
Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Relaxing monotonicity for innermost termination
- Proving termination of context-sensitive rewriting by transformation
- Mechanizing and improving dependency pairs
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Context-sensitive rewriting strategies
- Termination of term rewriting using dependency pairs
- Proving operational termination of membership equational programs
- Automating the dependency pair method
- Improving the Context-sensitive Dependency Graph
- Proving Termination of Context-Sensitive Rewriting with MU-TERM
- Termination of Rewriting with Strategy Annotations
- Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
- Context-Sensitive Dependency Pairs
- Transformation techniques for context-sensitive rewrite systems
- Term Rewriting and Applications
This page was built for publication: Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting