Proving Termination of Context-Sensitive Rewriting with MU-TERM
From MaRDI portal
Publication:2867963
DOI10.1016/J.ENTCS.2007.05.041zbMath1278.68113OpenAlexW2141699417MaRDI QIDQ2867963
Raúl Gutiérrez, Salvador Lucas, Beatriz Alarcón, José Iborra
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.041
Related Items (10)
Multi-completion with termination tools ⋮ Usable Rules for Context-Sensitive Rewrite Systems ⋮ Termination of just/fair computations in term rewriting ⋮ Operational Termination of Membership Equational Programs: the Order-Sorted Way ⋮ Characterizing and proving operational termination of deterministic conditional term rewriting systems ⋮ Context-sensitive dependency pairs ⋮ Proving Termination Properties with mu-term ⋮ Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting ⋮ MU-TERM ⋮ Termination of Narrowing Using Dependency Pairs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orderings for term-rewriting systems
- Termination of string rewriting proved automatically
- Proving termination of context-sensitive rewriting by transformation
- Context-sensitive rewriting strategies
- Termination of term rewriting using dependency pairs
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
- Solving Partial Order Constraints for LPO Termination
- Termination of context-sensitive rewriting
- Foundations of Software Science and Computation Structures
- Polynomials over the reals in proofs of termination : from theory to practice
- Context-Sensitive Dependency Pairs
- Transformation techniques for context-sensitive rewrite systems
- Term Rewriting and Applications
- Logic for Programming, Artificial Intelligence, and Reasoning
This page was built for publication: Proving Termination of Context-Sensitive Rewriting with MU-TERM
