Context-Sensitive Dependency Pairs
From MaRDI portal
Publication:5385994
DOI10.1007/11944836_28zbMath1177.68133OpenAlexW1535546114MaRDI QIDQ5385994
Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas
Publication date: 17 April 2008
Published in: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11944836_28
Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (8)
Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting ⋮ Usable Rules for Context-Sensitive Rewrite Systems ⋮ Automatic Proofs of Termination With Elementary Interpretations ⋮ Characterizing and proving operational termination of deterministic conditional term rewriting systems ⋮ Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting ⋮ Improving the Context-sensitive Dependency Graph ⋮ Proving Termination of Context-Sensitive Rewriting with MU-TERM ⋮ Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems
This page was built for publication: Context-Sensitive Dependency Pairs
