On proving \(C_E\)-termination of rewriting by size-change termination
From MaRDI portal
Publication:835016
DOI10.1016/j.ipl.2004.11.002zbMath1173.68544MaRDI QIDQ835016
Publication date: 27 August 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.11.002
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modularity of simple termination of term rewriting systems with shared constructors
- Generalized sufficient conditions for modular termination of rewriting
- On the modularity of termination of term rewriting systems
- Modular proofs for completeness of hierarchical term rewriting systems
- Hierarchical termination revisited.
- Termination of term rewriting using dependency pairs
- The size-change principle for program termination
- Automated Reasoning
- Automated Deduction – CADE-19