Results of the 2nd Rewriting Engines Competition
This page summarizes the presentation of the competition at WRLA'08.
There, after introducing the procedure followed in the competition (slides),
the five participating systems, namely ASF+SDF, Maude, Stratego/XT, TermWare and Tom, were introduced, and the results
were discussed (the table below was used to present the results).
The table gives the user times (additional info in the links) for the
different tests executed on each of the problems for each of the five
participant systems. The machine was a 1GHz/1GB linux box.
The participants were asked to provide a tool to
transform REC syntax
into their corresponding syntax (compilers for Maude, Stratego/XT and Tom
were provided). For each problem, in addition to the automatically
generated solution, a second optimized version of the
specification could be provided. Although no automatic trnaformation
tool was provided for them, ASF+SDF and TermWare provided manually
generated solutions for some of the problems.
Thus, in the table, for each of the problems,
we give the original problem in REC syntax and the tests run, and the
corresponding problems in the syntax of each the participant systems,
both in the automatically generated and manually generated/optimized
version, together with the times consumed in their computation (in
milliseconds). The holes indicate that there is no result in such case,
because it was not provided or, in some cases, because the computation
terminated abruptly or didn't terminate in a reasonable amount of time.
(There are some links still missing in the table, e.g. the ASF-SDF
problems were run and the times included, but the output files are not
available yet, as some of the results for Tom.)