Using context-sensitive rewriting for proving innermost termination of rewriting
DOI10.1016/J.ENTCS.2009.07.055zbMATH Open1337.68147OpenAlexW2119937562MaRDI QIDQ2808236FDOQ2808236
Authors: 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
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)
Cites Work
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Proving termination of context-sensitive rewriting with MU-TERM
- Termination of term rewriting using dependency pairs
- Title not available (Why is that?)
- Proving operational termination of membership equational programs
- Automating the dependency pair method
- Mechanizing and improving dependency pairs
- Context-sensitive rewriting strategies
- Improving the context-sensitive dependency graph
- Context-Sensitive Dependency Pairs
- Termination of rewriting with strategy annotations
- Title not available (Why is that?)
- Transformation techniques for context-sensitive rewrite systems
- Relaxing monotonicity for innermost termination
- Proving termination of context-sensitive rewriting by transformation
- Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
- Term Rewriting and Applications
Cited In (8)
- Termination of rewriting with strategy annotations
- Proving termination of context-sensitive rewriting by transformation
- Applications and extensions of context-sensitive rewriting
- A context-based approach to proving termination of evaluation
- Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
- Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
- Title not available (Why is that?)
- Proving termination properties with \textsc{mu-term}
Uses Software
This page was built for publication: Using context-sensitive rewriting for proving innermost termination of rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808236)
