|[MG:07]||Jens MÃ¼ller, Rubino GeiÃŸ, Speeding up Graph Transformation through Automatic Concatenation of Rewrite Rules, 2007.
The execution of graph transformations is sped up by automatically concatenating rewrite rules. We start by guessing which elements are already matched or created by one rule, and are re-used by the following rule afterwards. Then, we build a rule that combines the modifications of both rules, leaving out unneccesary intermediate steps. We use such combined rules to transform graph rewrite sequences, including a fallback for the case that the guess was wrong. Using this method, we achieve a speedup of nearly 50% in Varroâ€™s well-known mutex benchmark.