Finding small counterexamples for abstract rewriting properties

DOI10.1017/S0960129518000221MaRDI QIDQ4585013zbMATH OpenOpenAlexWikidataFDO

Authors Hans Zantema

Publication date 5 September 2018

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0960129518000221

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Proving non-termination by finite automata
• Counterexamples in infinitary rewriting with non-fully-extended rules
• Structures for abstract rewriting
• Counterexamples to termination for the direct sum of term rewriting systems
• Transforming SAT into termination of rewriting

Cites work

• scientific article; zbMATH DE number 4047065 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• A rewriting view of simple typing
• Confluence by Decreasing Diagrams
• Confluence by decreasing diagrams
• On the union of well-founded relations
• Termination by completion
• Triangulation in rewriting

Cited in

(2)

• First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification
• Revisiting MU puzzle: a case study in finite countermodels verification

This page was built for publication: Finding small counterexamples for abstract rewriting properties

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