Hierarchical termination revisited.

DOI10.1016/S0020-0190(02)00272-7zbMath1042.68602OpenAlexW2040067413MaRDI QIDQ1853138

Enno Ohlebusch

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00272-7

zbMATH Keywords

TerminationTheory of computationProgram correctnessTerm rewritingHierarchical programs

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

On proving \(C_E\)-termination of rewriting by size-change termination ⋮ Modular and incremental proofs of AC-termination ⋮ Modularity in term rewriting revisited ⋮ Automating the dependency pair method ⋮ Proving operational termination of membership equational programs ⋮ Hierarchical termination revisited.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized sufficient conditions for modular termination of rewriting
• Modular proofs for completeness of hierarchical term rewriting systems
• Hierarchical termination revisited.
• Modular termination proofs for rewriting using dependency pairs
• Termination of term rewriting using dependency pairs