Mohammed Houssem Hachmaoui

dblp:317/0144 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0001-8030-807XORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data models and query languages · 56% Query processing and optimization · 44%
Software engineering, system software, and programming languages
1 paper
Program verification · 50% Compilers and program optimization · 50%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Query processing and optimization
query compilation
0.612022
Translating canonical SQL to imperative code in Coq · Proc. ACM Program. Lang. 2022
Data models and query languages › SQL
SQL semantics
0.612022
Translating canonical SQL to imperative code in Coq · Proc. ACM Program. Lang. 2022
Program verification
mechanized verification
0.612022
Translating canonical SQL to imperative code in Coq · Proc. ACM Program. Lang. 2022
Compilers and program optimization
verified compilation
0.612022
Translating canonical SQL to imperative code in Coq · Proc. ACM Program. Lang. 2022
Data models and query languages › relational algebra
nested relational algebra
0.212022
Translating canonical SQL to imperative code in Coq · Proc. ACM Program. Lang. 2022

Methods — techniques the papers use, named apart from their topics

nested relational calculus · 1.1coq · 1.1
YearPublicationVenuePosition
2022 Translating canonical SQL to imperative code in Coq
abstract
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.
Véronique Benzaken, Evelyne Contejean, Mohammed Houssem Hachmaoui, Chantal Keller, Louis Mandel, Avraham Shinnar, Jérôme Siméon
Proc. ACM Program. Lang.3