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

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

Associated and Temporary Members

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)
Anthony Lick
PhD student, ANR Prodaq
 

More

About LSV

About Dahu

A joint team with

Logo INRIA Saclay

Recent Publications

All the Dahu publications

N. Grosshans, P. McKenzie and L. SegoufinThe power of programs over monoids in DAIn MFCS'17, Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik, August 2017. To appear. BibTeX )
L. Segoufin and A. VignyConstant Delay Enumeration for FO Queries over Databases with Local Bounded ExpansionIn ICDT'17, Leibniz International Proceedings in Informatics 68, pages 20:1-20:16. Leibniz-Zentrum für Informatik, March 2017. Web page | PDF | BibTeX )
Th. Colcombet, M. Jurdziński, R. Lazić and S. SchmitzPerfect Half Space GamesIn LICS'17. IEEE Press, June 2017. To appear. Web page | BibTeX )
P. Beame, N. Grosshans, P. McKenzie and L. SegoufinNondeterminism and An Abstract Formulation of Neciporuk's Lower Bound MethodACM Transactions on Computation Theory 9(1), pages 5:1-5:34, December 2016. BibTeX )
M. LehautPDL on infinite alphabet.  Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, August 2016. 19 pages. PDF | BibTeX )

All the Dahu publications