Skip to Main content Skip to Navigation
Conference papers

A Coq Formalization of the Relational Data Model

Véronique Benzaken 1, * Évelyne Contejean 2, 1, * Stefania Dumbrava 1
* Corresponding author
2 TOCCATA - Formally Verified Programs, Certified Tools and Numerical Computations
LRI - Laboratoire de Recherche en Informatique, Inria Saclay - Ile de France
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 metadata

https://hal.inria.fr/hal-00924156
Contributor : Evelyne Contejean <>
Submitted on : Monday, January 6, 2014 - 2:24:05 PM
Last modification on : Thursday, July 8, 2021 - 3:49:24 AM

Identifiers

  • HAL Id : hal-00924156, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

462