Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Véronique Benzaken"'
Autor:
Véronique Benzaken, Évelyne Contejean, Mohammed Houssem Hachmaoui, Chantal Keller, Louis Mandel, Avraham Shinnar, Jérôme Siméon
Publikováno v:
Proceedings of the ACM on Programming Languages
Proceedings of the ACM on Programming Languages, 2022, 6 (OOPSLA1), pp.1-27. ⟨10.1145/3527327⟩
Proceedings of the ACM on Programming Languages, 2022, 6 (OOPSLA1), pp.1-27. ⟨10.1145/3527327⟩
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 a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::58e08a0905f3fec0e939cb78aeecd529
Autor:
Véronique Benzaken, Évelyne Contejean, Rébecca Zucchini, Chantal Keller, Sarah Cohen-Boulakia
Publikováno v:
Certified Programs and Proofs
Certified Programs and Proofs, ACM, Jan 2021, Virtual Event, Denmark. ⟨10.1145/3437992.3439920⟩
CPP
Certified Programs and Proofs, ACM, Jan 2021, Virtual Event, Denmark. ⟨10.1145/3437992.3439920⟩
CPP
International audience; In multiple domains, large amounts of data are daily generated and combined to be analyzed. The interpretation of these analyses requires to track back the provenance of combined data with respect to initial, raw data. The cor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c1f186a0bea3e1f0566a1e49fbec259a
https://hal.science/hal-03380459
https://hal.science/hal-03380459
Autor:
Véronique Benzaken, Evelyne Contejean
Publikováno v:
EasyChair Preprints.
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, quantifiers and nested, potentially corre
Autor:
Evelyne Contejean, Véronique Benzaken
Publikováno v:
CPP 2019 Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs
CPP 19
CPP 19, ACM, Jan 2019, Cascais, Portugal. pp.249-261, ⟨10.1145/3293880.3294107⟩
CPP
HAL
CPP 19
CPP 19, ACM, Jan 2019, Cascais, Portugal. pp.249-261, ⟨10.1145/3293880.3294107⟩
CPP
HAL
International audience; In this article, we provide a Coq mechanised, executable, formal semantics for a realistic fragment of SQL consisting of select [distinct] from where group by having queries with NULL values, functions, aggregates, quantifiers
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8867b46b17a61fbf590750b9a0266ab
https://hal.archives-ouvertes.fr/hal-01830255
https://hal.archives-ouvertes.fr/hal-01830255
Publikováno v:
ITP 2018: Interactive Theorem Proving
ITP 2018-International Conference on Interactive Theorem Proving
ITP 2018-International Conference on Interactive Theorem Proving, Jul 2018, Oxford, United Kingdom. pp.88-107, ⟨10.1007/978-3-319-94821-8_6⟩
Interactive Theorem Proving ISBN: 9783319948201
ITP
ITP 2018-International Conference on Interactive Theorem Proving
ITP 2018-International Conference on Interactive Theorem Proving, Jul 2018, Oxford, United Kingdom. pp.88-107, ⟨10.1007/978-3-319-94821-8_6⟩
Interactive Theorem Proving ISBN: 9783319948201
ITP
International audience; In this article, we use the Coq proof assistant to specify and verify the low level layer of SQL's execution engines. To reach our goals, we first design a high-level Coq specification for data-centric operators intended to ca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0bd7d34963ccd92e7c3073631bc6d026
https://hal.archives-ouvertes.fr/hal-01716048/file/main.pdf
https://hal.archives-ouvertes.fr/hal-01716048/file/main.pdf
Autor:
Giuseppe Castagna, Laurent Daynès, Véronique Benzaken, Romain Vernoux, Kim Nguyen, Julien Lopez
Publikováno v:
WWW (Companion Volume)
WWW 2018-International World Wide Web Conference
WWW 2018-International World Wide Web Conference, Apr 2018, Lyon, France. pp.1-16, ⟨10.1145/3184558.3185973⟩
WWW 2018-International World Wide Web Conference
WWW 2018-International World Wide Web Conference, Apr 2018, Lyon, France. pp.1-16, ⟨10.1145/3184558.3185973⟩
International audience; We present BOLDR, a modular framework that enables the evaluation in databases of queries containing application logic and, in particular, user-defined functions. BOLDR also allows the nesting of queries for different database
Publikováno v:
International Conference on Interective Theorem Proving
International Conference on Interective Theorem Proving, 2017, Brasilia, Brazil
Interactive Theorem Proving ISBN: 9783319661063
ITP
HAL
International Conference on Interective Theorem Proving, 2017, Brasilia, Brazil
Interactive Theorem Proving ISBN: 9783319661063
ITP
HAL
International audience; We propose a SSReflect library for logic programming in the Datalog setting. As part of this work, we give a first mechanization of standard Datalog and of its extension with stratified negation. The library contains a formali
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc19d07c1ba0961fa47dbc749f9a9b4e
https://hal.archives-ouvertes.fr/hal-01745566/file/ITP2017.pdf
https://hal.archives-ouvertes.fr/hal-01745566/file/ITP2017.pdf
Publikováno v:
POPL
POPL, Jan 2013, Rome, Italy. pp.101-114, ⟨10.1145/2429069.2429083⟩
POPL, Jan 2013, Rome, Italy. pp.101-114, ⟨10.1145/2429069.2429083⟩
International audience; We present a calculus for processing semistructured data that spans differences of application area among several novel query languages, broadly categorized as ''NoSQL''. This calculus lets users define their own operators, ca
Publikováno v:
Journal of the ACM (JACM)
Journal of the ACM (JACM), Association for Computing Machinery, 2008, 55 (4), pp.1-64. ⟨10.1145/1391289.1391293⟩
Journal of the ACM (JACM), Association for Computing Machinery, 2008, 55 (4), pp.1-64. ⟨10.1145/1391289.1391293⟩
Subtyping relations are usually defined either syntactically by a formal system or semantically by an interpretation of types into an untyped denotational model. This work shows how to define a subtyping relation semantically in the presence of Boole