A Coq Formalization of the Relational Data Model

Véronique Benzaken 1, * Évelyne Contejean 2, 1, * Stefania Dumbrava 1
* Corresponding author
2 TOCCATA - Certified Programs, Certified Tools, Certified Floating-Point Computations
LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8623
Abstract : In this article, we propose a coq formalization of the relational data model which underlies relational database systems. More precisely, we present and formalize the data definition part of the model including integrity constraints. We model two different query language formalisms: relational algebra and conjunctive queries. The former is the basis of We also present logical query optimization and prove the main ''database theorems'': algebraic equivalences, the homomorphism theorem and conjunctive query minimization.
Document type :
Conference papers
Complete list of metadatas

Contributor : Evelyne Contejean <>
Submitted on : Monday, January 6, 2014 - 2:24:05 PM
Last modification on : Monday, February 11, 2019 - 6:22:01 PM


  • HAL Id : hal-00924156, version 1



Véronique Benzaken, Évelyne Contejean, Stefania Dumbrava. A Coq Formalization of the Relational Data Model. ESOP - 23rd European Symposium on Programming, Apr 2014, Grenoble, France. ⟨hal-00924156⟩



Record views