Improving Context-Sensitive Dependency Pairs
From MaRDI portal
Publication:5505586
DOI10.1007/978-3-540-89439-1_44zbMATH Open1182.68092OpenAlexW2149277601MaRDI QIDQ5505586FDOQ5505586
Authors: Beatriz Alarcón, Fabian Emmes, Carsten Fuhs, Jürgen Giesl, Raúl Gutiérrez, Salvador Lucas, Peter Schneider-Kamp, René Thiemann
Publication date: 27 January 2009
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-89439-1_44
Recommendations
Cited In (13)
- mu-term: Verify Termination Properties Automatically (System Description)
- Context-Sensitive Dependency Pairs
- Lazy productivity via termination
- Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
- Applications and extensions of context-sensitive rewriting
- Proving termination in the context-sensitive dependency pair framework
- Improving the context-sensitive dependency graph
- Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications
- 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
- From Outermost to Context-Sensitive Rewriting
This page was built for publication: Improving Context-Sensitive Dependency Pairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505586)