DAHU: Databases and Verification

The need to access and exchange data on the Web has led to database management systems (DBMS) that are increasingly distributed and autonomous. Data extraction and querying on the Web is harder than in classical DBMS, because such data is heterogeneous, redundant, inconsistent and subject to frequent modifications. DBMS thus need to be able to detect errors, to analyze them and to correct them. Moreover, increasingly complex Web applications and services rely on DBMS, and their reliability is crucial. This creates a need for tools for specifying DBMS in a high-level manner that is easier to understand, while also facilitating verification of critical properties.

The study of such specification and verification techniques is the main goal of Dahu.

Members

Permanent Members

Serge Abiteboul
Senior researcher, INRIA Saclay-Île de France
Sylvain Schmitz
Assistant professor, ENS Cachan
Luc Segoufin
Senior researcher, INRIA Saclay-Île de France

Associated and Temporary Members

Karima Rafes
PhD student, BorderCloud
Victor Vianu
Researcher, chaire INRIA (professor, UC San Diego)
Alexandre Vigny
PhD student (joint with Paris 7)

Ph.D. Students

Nathan Grosshans
PhD student, Digiteo (joint with U. Montreal, Canada)
David Montoya
PhD student, INRIA & Cofely INEO
 
Anthony Lick
PhD student, ANR Prodaq
Su Yang
PhD student

More

About LSV

About Dahu

A joint team with

Logo INRIA Saclay

Recent Publications

All the Dahu publications

P. Beame, N. Grosshans, P. McKenzie and L. SegoufinNondeterminism and an abstract formulation of Neciporuk's lower bound method.  Research Report 1608.01932, Computing Research Repository, August 2016. 34 pages. PDF | BibTeX )
D. Montoya, T. Pellissier Tanon, S. Abiteboul and F. SuchanekThymeflow, A Personal Knowledge Base with Spatio-temporal DataIn CIKM'16, pages 2477-2480. ACM, October 2016. Web page | PDF | BibTeX )
A. LickSystèmes de preuves pour logiques modales.  Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, August 2016. 20 pages. PDF | BibTeX )
T. Place and L. SegoufinDecidable Characterization of FO2(<, +1) and locality of DA.  Research Report 1606.03217, Computing Research Repository, June 2016. 8 pages. PDF | BibTeX )
F. Jacquemard, L. Segoufin and J. DiminoFO2(<, +1, extasciitilde) on data trees, data tree automata and branching vector addition systemsLogical Methods in Computer Science 12(2), 2016. Web page | PDF | BibTeX )

All the Dahu publications