3 papers
cs.PL2026
Formally Verified Linear-Time Invertible Lexing
Samuel Chassot, Viktor KunÄak
We present ZipLex, a verified framework for invertible linear-time lexical analysis following the longest match (maximal munch) semantics. Unlike past verified lexers that focus on…
cs.PL2024
Verified invertible lexer using regular expressions and DFAs
Samuel Chassot, Viktor KunÄak
In this project, we explore the concept of invertibility applied to serialisation and lexing frameworks. Recall that, on one hand, serialisation is the process of taking a data str…
cs.SE2024
Formally Verifiable Generated ASN.1/ACN Encoders and Decoders: A Case Study
Mario Bucev, Samuel Chassot, Simon Felix +2
We propose a verified executable Scala backend for ASN1SCC, a compiler for ASN.1/ACN. ASN.1 is a language for describing data structures widely employed in ground and space telecom…