Testing confluence of nonterminating rewriting systems

DOI10.1007/3-540-54317-1_85MaRDI QIDQ5881272zbMATH OpenOpenAlexFDO

Authors Michael J. O'Donnell, Yi-Yun Chen

Publication date 9 March 2023

Published in Conditional and Typed Rewriting Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-54317-1_85

Mathematics Subject Classification ID

Logic programming (68N17) Grammars and rewriting systems (68Q42)

Recommendations

• Term Rewriting and Applications
• Confluence by critical pair analysis
• Confluence of non-left-linear TRSs via relative termination
• A reduction-preserving completion for proving confluence of non-terminating term rewriting systems
• A reduction-preserving completion for proving confluence of non-terminating term rewriting systems

Cites work

• Computing in systems described by equations
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• scientific article; zbMATH DE number 4037157 (Why is no real title available?)
• scientific article; zbMATH DE number 3730111 (Why is no real title available?)

Cited in

(8)

• A reduction-preserving completion for proving confluence of non-terminating term rewriting systems
• Conformance Tests as Checking Experiments for Partial Nondeterministic FSM
• Semantic confluence tests and completion methods
• Streaming Property Testing of Visibly Pushdown Languages *
• Fundamental Approaches to Software Engineering
• A reduction-preserving completion for proving confluence of non-terminating term rewriting systems
• Infinite terms and infinite rewritings
• Proving ground confluence of equational specifications modulo axioms

This page was built for publication: Testing confluence of nonterminating rewriting systems

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