Improving the Context-sensitive Dependency Graph

DOI10.1016/J.ENTCS.2007.05.040zbMath1278.68114OpenAlexW2132847612MaRDI QIDQ2867962

Raúl Gutiérrez, Salvador Lucas, Beatriz Alarcón

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

zbMATH Keywords

program analysisterminationterm rewritingdependency pairs

Mathematics Subject Classification ID

Theory of programming languages (68N15) Grammars and rewriting systems (68Q42)

Related Items (5)

Usable Rules for Context-Sensitive Rewrite Systems ⋮ Characterizing and proving operational termination of deterministic conditional term rewriting systems ⋮ Context-sensitive dependency pairs ⋮ Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting ⋮ Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems

Uses Software

• AProVE
• MU-TERM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proving termination of context-sensitive rewriting by transformation
• Context-sensitive rewriting strategies
• Termination of term rewriting using dependency pairs
• Termination of context-sensitive rewriting
• Context-Sensitive Dependency Pairs
• Transformation techniques for context-sensitive rewrite systems

This page was built for publication: Improving the Context-sensitive Dependency Graph