Labelings for Decreasing Diagrams.

DOI10.4230/LIPICS.RTA.2011.377MaRDI QIDQ5389095zbMATH OpenOpenAlexFDO

Authors Harald Zankl, Bertram Felgenhauer, Aart Middeldorp

Publication date 24 April 2012

Full work available at URL https://arxiv.org/abs/1406.3139, http://subs.emis.de/LIPIcs/frontdoor_e557.html

zbMATH Keywords

confluencedecreasing diagramslabelingterm rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Abstract: This article is concerned with automating the decreasing diagrams technique of van Oostrom for establishing confluence of term rewrite systems. We study abstract criteria that allow to lexicographically combine labelings to show local diagrams decreasing. This approach has two immediate benefits. First, it allows to use labelings for linear rewrite systems also for left-linear ones, provided some mild conditions are satisfied. Second, it admits an incremental method for proving confluence which subsumes recent developments in automating decreasing diagrams. The techniques proposed in the article have been implemented and experimental results demonstrate how, e.g., the rule labeling benefits from our contributions.

Recommendations

• Labelings for decreasing diagrams
• Decreasing diagrams and relative termination
• Decreasing diagrams and relative termination
• Proof orders for decreasing diagrams
• Decreasing diagrams for confluence and commutation
• Confluence by decreasing diagrams
• scientific article; zbMATH DE number 4070955
• Boundary labeling for rectangular diagrams
• Confluence by decreasing diagrams -- formalized

Cited in

(15)

• Labelings for decreasing diagrams
• Layer systems for proving confluence
• Confluence by decreasing diagrams -- formalized
• Certifying confluence proofs via relative termination and rule labeling
• Confluence by Decreasing Diagrams
• Decreasing diagrams and relative termination
• Decreasing diagrams with two labels are complete for confluence of countable systems
• Decreasing diagrams for confluence and commutation
• Proving confluence of term rewriting systems via persistency and decreasing diagrams
• CSI -- a confluence tool
• Certified rule labeling
• Automated confluence proof by decreasing diagrams based on rule-labelling
• Confluence: the unifying, expressive power of locality
• Decreasing diagrams and relative termination
• De Bruijn's weak diamond property revisited

This page was built for publication: Labelings for Decreasing Diagrams.

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