Finding small counterexamples for abstract rewriting properties

DOI10.1017/S0960129518000221zbMATH Open1398.68287OpenAlexW2577059133WikidataQ124988910 ScholiaQ124988910MaRDI QIDQ4585013FDOQ4585013

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

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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Title not available (Why is that?)
• Confluence by decreasing diagrams
• Confluence by Decreasing Diagrams
• Title not available (Why is that?)
• Termination by completion
• On the union of well-founded relations
• A rewriting view of simple typing
• 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)