Evelyne Contejean

Evelyne Contejean

Auto-generated profile, based on publicly available information

Evelyne Contejean

LMF, France / CNRS, France / Université Paris-Saclay, France

Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 February 1997 in Theoretical Computer Science
Verified
Journal Article
Closed access
FAFarid Ajili
Farid Ajili
ECEvelyne Contejean
Evelyne Contejean

6 November 2007
Verified
Conference Paper
Open access
PDF file
SCSylvain Conchon
Sylvain Conchon
ECEvelyne Contejean
Evelyne Contejean
JKJohannes Kanig
Johannes Kanig
SLStéphane Lescuyer
Stéphane Lescuyer

4 July 2018
Verified
Book Chapter
Closed access
PDF file
VBV. Benzaken
V. Benzaken
ÉCÉ. Contejean
É. Contejean
CKCh. Keller
Ch. Keller
EME. Martins
E. Martins

29 April 2022 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
VBVéronique Benzaken
Véronique Benzaken
ÉCÉvelyne Contejean
Évelyne Contejean
MHMohammed Houssem Hachmaoui
Mohammed Houssem Hachmaoui
CKChantal Keller
Chantal Keller
LMLouis Mandel
Louis Mandel
JSJérôme Siméon
Jérôme Siméon
SQL is by far the most widely used and implemented query language. Yet, on some key features, such as correlated queries and NULL value semantics, many implementations diverge or contain bugs. We leverage recent advances in the formalization of SQL and query compilers to develop DBCert, the first mechanically verified compiler from SQL queries written in a canonical form to imperative code. Building DBCert required several new contributions which are described in this paper. First, we specify and mechanize a complete translation from SQL to the Nested Relational Algebra which can be used for query optimization. Second, we define Imp, a small imperative language sufficient to express SQL and which can target several execution languages including JavaScript. Finally, we develop a mechanized translation from the nested relational algebra to Imp, using the nested relational calculus as an intermediate step.

9 July 2018 in HAL
Verified
Preprint
Open access
PDF file
VBV Benzaken
V Benzaken
ÉCÉ Contejean
É Contejean
In this article, we provide a Coq mechanised, executable, formal semantics for realistic SQL queries consisting of select [distinct] from where group by having queries with NULL values, functions, aggregates, quanti-fiers and nested potentially correlated sub-queries. We then relate this fragment to a Coq formalised (extended) relational algebra that enjoys a bag semantics. Doing so we provide the first formally mechanised proof of the equivalence of SQL and extended relational algebra and, from a compilation perspective, thanks to the Coq extraction mechanism to Ocaml, a Coq certified semantic analyser for a SQL compiler.