The Rewrite Engines Competitions: A RECtrospective

Durán, Francisco; Garavel, Hubert

doi:10.1007/978-3-030-17502-3_6

Cited by 6 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first is our running example TWO-COUNTERS with different inputs (10, 20, 50, and 100). The second is REC [11], which is a popular performance benchmark for rewriting engines. We evaluate both the performance of proof object generation and that of proof checking.…”

Section: Discussionmentioning

confidence: 99%

Towards a Trustworthy Semantics-Based Language Framework via Proof Generation

Chen

Lin

Trinh

et al. 2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We pursue the vision of an ideal language framework, where programming language designers only need to define the formal syntax and semantics of their languages, and all language tools are automatically generated by the framework. Due to the complexity of such a language framework, it is a big challenge to ensure its trustworthiness and to establish the correctness of the autogenerated language tools. In this paper, we propose an innovative approach based on proof generation. The key idea is to generate proof objects as correctness certificates for each individual task that the language tools conduct, on a case-by-case basis, and use a trustworthy proof checker to check the proof objects. This way, we avoid formally verifying the entire framework, which is practically impossible, and thus can make the language framework both practical and trustworthy. As a first step, we formalize program execution as mathematical proofs and generate their complete proof objects. The experimental result shows that the performance of our proof object generation and proof checking is very promising.

show abstract

Section: Discussionmentioning

confidence: 99%

Towards a Trustworthy Semantics-Based Language Framework via Proof Generation

Chen

Lin

Trinh

et al. 2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The evaluation of term rewriting systems (TRSs) is an irregular problem that is interesting for the formal methods community. For example, term rewriting increases the expressiveness of models in the area of model checking [9] and the performance of term rewriting is a long-standing and important objective [10]. Many-sorted term rewriting systems involve sorts, i.e., data types, which provides a means to require that terms are well-sorted.…”

Section: Introductionmentioning

confidence: 99%

Innermost many-sorted term rewriting on GPUs

Eerd

Groote

Hijma

et al. 2023

Science of Computer Programming

View full text Add to dashboard Cite

TOOLympics 2019: An Overview of Competitions in Formal Methods

Bartocci

Beyer

Black³

et al. 2019

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

Evaluation of scientific contributions can be done in many different ways. For the various research communities working on the verification of systems (software, hardware, or the underlying involved mechanisms), it is important to bring together the community and to compare the state of the art, in order to identify progress of and new challenges in the research area. Competitions are a suitable way to do that. The first verification competition was created in 1992 (SAT competition), shortly followed by the CASC competition in 1996. Since the year 2000, the number of dedicated verification competitions is steadily increasing. Many of these events now happen regularly, gathering researchers that would like to understand how well their research prototypes work in practice. Scientific results have to be reproducible, and powerful computers are becoming cheaper and cheaper, thus, these competitions are becoming an important means for advancing research in verification technology. TOOLympics 2019 is an event to celebrate the achievements of the various competitions, and to understand their commonalities and differences. This volume is dedicated to the presentation of the 16 competitions that joined TOOLympics as part of the celebration of the 25 th anniversary of the TACAS conference.

show abstract

The Rewrite Engines Competitions: A RECtrospective

Cited by 6 publications

References 16 publications

Towards a Trustworthy Semantics-Based Language Framework via Proof Generation

Towards a Trustworthy Semantics-Based Language Framework via Proof Generation

Innermost many-sorted term rewriting on GPUs

TOOLympics 2019: An Overview of Competitions in Formal Methods

Contact Info

Product

Resources

About