2002 · 154 citations · 19 references
ComputingComputer ScienceFormal MethodsAbstract Syntax TreesAutomata TheoryFinite AutomataPredicate LogicSpecification LanguagesDecision ProceduresRewrite SystemsRewriting SystemsTerm RewritingTree Grammars
Using tree automata techniques, it is proven that the theory of ground rewrite systems is decidable. Novel decision procedures are presented for most classic properties of ground rewrite systems. An example is presented to illustrate how these results could be used for specification and debugging.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
19
Nachum Dershowitz · Journal of Symbolic Computation · 1987 · 725 citations
Fast Decision Procedures Based on Congruence Closure
Greg Nelson, Derek C. Oppen · Journal of the ACM · 1980 · 509 citations · Full text
Wolfgang Thomas · 1988 · 432 citations