Coqlex: Generating Formally Verified Lexers - Archive ouverte HAL Access content directly
Reports Year : 2022

Coqlex: Generating Formally Verified Lexers


A compiler consists of a sequence of phases going from lexical analysis to code generation. Ideally, the formal verication of a compiler should include the formal veri cation of each component of the tool-chain. e Compcert project, a formally veri ed C compiler, comes with associated tools and proofs that allow to formally verify most of those components. However, some components, in particular the lexer, remain unveri ed. In order to contribute to the end-to-end veri cation of compilers, we implemented a veri ed lexer generator whose usage is similar to OCamllex. Our so ware, called Coqlex, reads a lexer speci cation and generates a lexer equipped with Coq proofs of its correctness. It provides a formally veri ed implementation of most features that standard lexer generators (that are not formally veried) usually have. We also give a performance evaluation, comparing Coqlex to OCamllex and Verbatim++.
Fichier principal
Vignette du fichier
template.pdf (576.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03912170 , version 1 (15-01-2023)


Attribution - NonCommercial - CC BY 4.0


  • HAL Id : hal-03912170 , version 1


Wendlasida Ouedraogo, Lutz Strassburger, Gabriel Scherer. Coqlex: Generating Formally Verified Lexers. INRIA Saclay - Ile-de-France. 2022. ⟨hal-03912170⟩
12 View
4 Download


Gmail Facebook Twitter LinkedIn More