Improving the context-sensitive dependency graph
From MaRDI portal
Publication:2867962
DOI10.1016/J.ENTCS.2007.05.040zbMATH Open1278.68114OpenAlexW2132847612MaRDI QIDQ2867962FDOQ2867962
Authors: Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas 
Publication date: 20 December 2013
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.2007.05.040
Recommendations
Cites Work
- Termination of term rewriting using dependency pairs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Termination of context-sensitive rewriting
- Context-sensitive rewriting strategies
- Context-Sensitive Dependency Pairs
- Title not available (Why is that?)
- Transformation techniques for context-sensitive rewrite systems
- Proving termination of context-sensitive rewriting by transformation
Cited In (10)
- Context-Sensitive Dependency Pairs
- Improving Context-Sensitive Dependency Pairs
- Beyond Dependency Graphs
- Proving termination in the context-sensitive dependency pair framework
- Using context-sensitive rewriting for proving innermost termination of rewriting
- Characterizing and proving operational termination of deterministic conditional term rewriting systems
- Mechanizing and improving dependency pairs
- Usable Rules for Context-Sensitive Rewrite Systems
- Context-sensitive dependency pairs
- Decidability of innermost termination and context-sensitive termination for semi-constructor term rewriting systems
Uses Software
This page was built for publication: Improving the context-sensitive dependency graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867962)
