On tree automata that certify termination of left-linear term rewriting systems (original) (raw)
Related papers
Non-termination using Regular Languages
Proving non-termination by finite automata
2015
Autowrite: A Tool for Term Rewrite Systems and Tree Automata
Electronic Notes in Theoretical Computer Science, 2005
mu-term: a tool for proving termination of rewriting with replacement restrictions
WST'04 7th International Workshop on …, 2003
Proving termination of rewriting automatically
Termination of String Rewriting Proved Automatically
Journal of Automated Reasoning, 2005
Modular proofs for completeness of hierarchical term rewriting systems
Theoretical Computer Science, 1995
Decidable call-by-need computations in term rewriting
Information and Computation, 2005
Frontiers of Combining Systems, 2011
Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems
Electronic Proceedings in Theoretical Computer Science, 2010
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Electronic Notes in Theoretical Computer Science, 2007
mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting
Rewriting Techniques and Applications, 2004
An overview of term rewriting systems
African Journal of Mathematics and Computer Science Research, 2012
Confluence of Right Ground Term Rewriting Systems is Decidable
Foundations of Software Science and Computational …, 2005
Decidable call by need computations in term rewriting (extended abstract)
Lecture Notes in Computer Science, 1997
Completeness of Tree Automata Completion
2018
Semantics of non-terminating rewrite systems using minimal coverings
1995
Decidability of Innermost Termination for Semi-Constructor Term Rewriting Systems
Proving Looping and Non-Looping Non-Termination by Finite Automata
ArXiv, 2015
IEICE Transactions on Information and Systems, 2010
Automata Completion and Regularity Preservation
2017
Termination of logic programs via labelled term rewrite systems
A path ordering for proving termination of term rewriting systems
Mathematical Foundations of …, 1985
2 Automata Completion and Regularity Preservation
2019
Regular language type inference with term rewriting
Proceedings of the ACM on Programming Languages, 2020
Well-foundedness for Termination of Term Rewriting Systems
2013
IPSJ Online Transactions, 2009
Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting
Electronic Notes in Theoretical Computer Science, 2009
Natural Rewriting for General Term Rewriting Systems
2004
An Optimised Algorithm for Determinisation and Completion of Finite Tree Automata
Computer Science Research Report, 2011
Handling Non Left-Linear Rules When Completing Tree Automata
International Journal of Foundations of Computer Science, 2009
Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems
IPSJ Online Transactions, 2011