Hierarchical termination revisited.

DOI10.1016/S0020-0190(02)00272-7MaRDI QIDQ1853138zbMATH OpenOpenAlexFDO

Authors 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

Hierarchical programsProgram correctnessTerm rewritingTerminationTheory of computation

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites work

• Generalized sufficient conditions for modular termination of rewriting
• Hierarchical termination revisited.
• scientific article; zbMATH DE number 1479616 (Why is no real title available?)
• scientific article; zbMATH DE number 1765695 (Why is no real title available?)
• scientific article; zbMATH DE number 1765702 (Why is no real title available?)
• scientific article; zbMATH DE number 794237 (Why is no real title available?)
• Modular proofs for completeness of hierarchical term rewriting systems
• Modular termination proofs for rewriting using dependency pairs
• Termination of term rewriting using dependency pairs

Cited in

(6)

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

This page was built for publication: Hierarchical termination revisited.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853138)