Links and navegation
Contact:
   duran 'at' lcc.uma.es

II Rewrite Engines Competition (REC)

As part of WRLA'06, the first rewrite engines competition was celebrated. With it, the rewrite engines competition project started, to be celebrated together with the workshop (every two years). In its first edition, only Maude and ASF+SDF participated, but a significant number of rewriting problems were already collected.

One of the first conclusions of the first competition was that there is no winner. Each of the engines focusses on very specific problems, and they are very good at them. We found the competition very illustrative, for newcomers and the community in general, since it allows us to see the variaty of languages available, being able to choose the right language for each kind of application. 

The aim of this web site is to provide information on the competition, including links to the current rewriting engines (participating in the competition or not), sets of interesting problems for rewriting engines (to be used in the competition), and its results.

These are the rewrite engines participating in this edition of the competition:
These are the rewriting problems proposed for the competition (updated on March 24th, 2008). Most of them were used the first edition of the competition. Some are from the ASF+SDF and Maude benchmarks. We are grateful to Mark van der Brand and Steven Eker. A summary of the results is available. For additional details:

F. Durán, M. Roldán, E. Balland, M. van den Brand, S. Eker, K.T. Kalleberg, L.C.L. Kats, P.-E. Moreau, R. Schevchenko and E. Visser. The Second Rewrite Engines Competition. In G. Rosu (ed.), Proceedings of the 7th International Workshop on Rewriting Logic and its Applications (WRLA 2008), ENTCS 238(3): 281-291, 2009.

All the problems proposed for the REC are written using a versy simple rewriting language REC with the following syntax.

As an additional problem we propose the implementation in the participating systems of a program transforming REC programs into the corresponding languages.

Please let us know if you new interesting problems to be included in the benchmark.