7 citations · 8 across the 3 of their papers we have counts for
4 papers
Term Rewriting Based On Set Automaton Matching
Mark Bouwman, Rick Erkens
In this article we investigate how a subterm pattern matching algorithm can be exploited to implement efficient term rewriting procedures. From the left-hand sides of the rewrite s…
A Set Automaton to Locate All Pattern Matches in a Term
Rick Erkens, Jan Friso Groote
Term pattern matching is the problem of finding all pattern matches in a subject term, given a set of patterns. Finding efficient algorithms for this problem is an important direct…
Adaptive Non-linear Pattern Matching Automata
Rick Erkens, Maurice Laveaux
Efficient pattern matching is fundamental for practical term rewrite engines. By preprocessing the given patterns into a finite deterministic automaton the matching patterns can be…
Up-to Techniques for Branching Bisimilarity
Rick Erkens, Jurriaan Rot, Bas Luttik
Ever since the introduction of behavioral equivalences on processes one has been searching for efficient proof techniques that accompany those equivalences. Both strong bisimilarit…