Evelyne Contejean
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Evelyne Contejean has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Avraham Shinnar
IBM Research, Yorktown Heights, NY, USA
1 shared publication Ch. Keller
Université Paris Sud, LRI
1 shared publication- Chantal Keller
LMF - University Paris-Saclay, Gif-sur-Yvette, France
1 shared publication E. Martins
Université Paris Sud, LRI
1 shared publicationFarid Ajili
INRIA Lorraine & CRIN, 615 rue du jardin botanique BP 101, 54602 Villers-lès-Nancy Cedex, France
1 shared publicationJohannes Kanig
INRIA Futurs, ProVal, Orsay, LRI, Univ Paris-Sud, CNRS, Orsay
1 shared publication
Latest Publications
- Open Access
- 29 April 2022
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 6 (OOPSLA1) , 1-27
Translating canonical SQL to imperative code in Coq
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.
- 29 April 2022
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 6 (OOPSLA1) , 1-27
Open AccessTranslating canonical SQL to imperative code in Coq
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.
- Open Access
A Coq mechanised formal semantics for realistic SQL queries * Formally reconciling SQL and bag relational algebra
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.
Open AccessA Coq mechanised formal semantics for realistic SQL queries * Formally reconciling SQL and bag relational algebra
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.
- Open Access
- 6 November 2007
- Published by Association for Computing Machinery (ACM)
- p. 55-59
Lightweight integration of the Ergo theorem prover inside a proof assistant
- 6 November 2007
- Published by Association for Computing Machinery (ACM)
- p. 55-59
Open AccessLightweight integration of the Ergo theorem prover inside a proof assistant
- 20 February 1997
- Published by Elsevier in Theoretical Computer Science
- Vol. 173 (1) , 183-208
Avoiding slack variables in the solving of linear diophantine equations and inequations
- 20 February 1997
- Published by Elsevier in Theoretical Computer Science
- Vol. 173 (1) , 183-208
Avoiding slack variables in the solving of linear diophantine equations and inequations