Reachability, confluence, and termination analysis with state-compatible automata
Authors:
- Bertram FelgenhauerBFBertram Felgenhauer
- René ThiemannRTRené Thiemann
Open Access
- 1 April 2017
- journal article
- Published by Elsevier in Information and Computation
- Vol. 253, 467-483
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Match-bounds revisitedInformation and Computation, 2009
- On tree automata that certify termination of left-linear term rewriting systemsInformation and Computation, 2007
- Reachability Analysis over Term Rewriting SystemsJournal of Automated Reasoning, 2004