Improving the context-sensitive dependency graph

DOI10.1016/J.ENTCS.2007.05.040MaRDI QIDQ2867962zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

term rewritingterminationdependency pairsprogram analysis

Mathematics Subject Classification ID

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

Recommendations

• Improving Context-Sensitive Dependency Pairs
• Context-sensitive dependency pairs
• Proving termination in the context-sensitive dependency pair framework
• Context-Sensitive Dependency Pairs
• Improving dependency pairs

Cites work

• scientific article; zbMATH DE number 1729952 (Why is no real title available?)
• scientific article; zbMATH DE number 1332639 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• scientific article; zbMATH DE number 2090310 (Why is no real title available?)
• Context-Sensitive Dependency Pairs
• Context-sensitive rewriting strategies
• Proving termination of context-sensitive rewriting by transformation
• Termination of context-sensitive rewriting
• Termination of term rewriting using dependency pairs
• Transformation techniques for context-sensitive rewrite systems

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
• Context-sensitive dependency pairs
• Usable Rules for Context-Sensitive Rewrite Systems
• Decidability of innermost termination and context-sensitive termination for semi-constructor term rewriting systems

Describes a project that uses

Uses Software

• MU-TERM
• AProVE

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)