The Second Rewrite Engines Competition

Durán, Francisco; Roldán, Manuel; Balland, Émilie; Brand, Mark van den; Eker, Steven; Kalleberg, Karl Trygve; Kats, Lennart C.L.; Moreau, Pierre-Étienne; Schevchenko, Ruslan; Visser, Eelco

doi:10.1016/j.entcs.2009.05.025

Cited by 5 publications

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…REC2 [15] expanded on the ideas of REC1, with a double goal: (i) broaden the comparison by assessing the efficiency of a larger number of rewrite enginesindeed, five tools participated in REC2; and (ii) being a showcase for the term-rewriting community, with a dedicated session at WRLA 2008, where all participating tools were presented by their developers, who exposed the features and strengths of each tool and discussed the outcomes of the competition. Tool developers actively participated in the whole process of REC2, not merely for adapting competition benchmarks to the tools, but also for exchanging views on how to organize the competition and present its results.…”

Section: Evolution Of Rec Competitionsmentioning

confidence: 99%

“…REC2 [15] brought a significant evolution: in REC1, each benchmark was specified in the input language of each tool, which was only feasible as the number of tools was small. REC2 introduced, to express its benchmarks, a common language, which we name REC-2008 and which was inspired by the TPDB language used at that time by the Termination Competition (the Confluence Competition uses a similar language).…”

Section: Rec Benchmarksmentioning

confidence: 99%

See 1 more Smart Citation

The Rewrite Engines Competitions: A RECtrospective

Durán

Garavel

2019

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

Term rewriting is a simple, yet expressive model of computation, which finds direct applications in specification and programming languages (many of which embody rewrite rules, pattern matching, and abstract data types), but also indirect applications, e.g., to express the semantics of data types or concurrent processes, to specify program transformations, to perform computer-aided verification, etc. The Rewrite Engines Competition (REC) was created under the aegis of the Workshop on Rewriting Logic and its Applications (WRLA) to serve three main goals: (i) being a forum in which tool developers and potential users of term rewrite engines can share experience; (ii) bringing together the various language features and implementation techniques used for term rewriting; and (iii) comparing the available term rewriting languages and tools in their common features. The present article provides a retrospective overview of the four editions of the Rewrite Engines Competition (

show abstract

Section: Evolution Of Rec Competitionsmentioning

confidence: 99%

Section: Rec Benchmarksmentioning

confidence: 99%

The Rewrite Engines Competitions: A RECtrospective

Durán

Garavel

2019

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…• REC-17 : Between September 2016 and February 2017, Hubert Garavel and Lina Marsso undertook the translation of LOTOS-92 into a term rewrite system 7 . This system was encoded in the simple language REC proposed in [6,Sect. 3] and [5,Sect.…”

Section: Executable Formal Specificationsmentioning

confidence: 99%

Comparative Study of Eight Formal Specifications of the Message Authenticator Algorithm

Garavel¹,

Marsso²

2018

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

The Message Authenticator Algorithm (MAA) is one of the first cryptographic functions for computing a Message Authentication Code. Between 1987 and 2001, the MAA was adopted in international standards (ISO 8730 and ISO 8731-2) to ensure the authenticity and integrity of banking transactions. In 1990 and 1991, three formal, yet non-executable, specifications of the MAA (in VDM, Z, and LOTOS) were developed at NPL. Since then, five formal executable specifications of the MAA (in LOTOS, LNT, and term rewrite systems) have been designed at INRIA Grenoble. This article provides an overview of the MAA and compares its formal specifications with respect to common-sense criteria, such as conciseness, readability, and efficiency of code generation.

show abstract

“…Taking Garavel & Turlier's LOTOS specification as a starting point, our central contribution is a formal model of the MAA specified as a term rewrite system. This model is expressed using the notations of the simple rewriting language REC proposed in [5,Sect. 3] and [4,Sect.…”

Section: Specification Of the Maa As A Term Rewrite Systemmentioning

confidence: 99%

A Large Term Rewrite System Modelling a Pioneering Cryptographic Algorithm

Garavel¹,

Marsso²

2017

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

We present a term rewrite system that formally models the Message Authenticator Algorithm (MAA), which was one of the first cryptographic functions for computing a Message Authentication Code and was adopted, between 1987 and 2001, in international standards to ensure the authenticity and integrity of banking transactions. Our term rewrite system is large (13 sorts, 18 constructors, 644 non-constructors, and 684 rewrite rules), confluent, and terminating. Implementations in thirteen different languages have been automatically derived from this model and used to validate 200 official test vectors for the MAA.

show abstract

The Second Rewrite Engines Competition

Cited by 5 publications

References 8 publications

The Rewrite Engines Competitions: A RECtrospective

The Rewrite Engines Competitions: A RECtrospective

Comparative Study of Eight Formal Specifications of the Message Authenticator Algorithm

A Large Term Rewrite System Modelling a Pioneering Cryptographic Algorithm

Contact Info

Product

Resources

About