Certifying Confluence of Almost Orthogonal CTRSs via Exact Tree Automata Completion
From MaRDI portal
Publication:5369494
DOI10.4230/LIPIcs.FSCD.2016.29zbMath1388.68155OpenAlexW2538384822MaRDI QIDQ5369494
Thomas Sternagel, Christian Sternagel
Publication date: 17 October 2017
Full work available at URL: https://dblp.uni-trier.de/db/conf/rta/fscd2016.html#SternagelS16
Related Items (4)
First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification ⋮ Use of logical models for proving infeasibility in term rewriting ⋮ Proving semantic properties as first-order satisfiability ⋮ Certified equational reasoning via ordered completion
Uses Software
This page was built for publication: Certifying Confluence of Almost Orthogonal CTRSs via Exact Tree Automata Completion
