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
Luc Segoufin
Senior researcher, INRIA
 
Sylvain Schmitz
Researcher, délégation INRIA (Assistant professor, ENS Cachan)
Cristina Sirangelo
Assistant professor, ENS Cachan

Associated and Temporary Members

Victor Vianu
Researcher, chaire INRIA (professor, UC San Diego)
 

Ph.D. Students

Nadime Francis
PhD student, ENS Cachan
Nathan Grosshans
PhD student, Digiteo (joint with U. Montreal, Canada)
David Montoya
PhD student

More

About LSV

About Dahu

A joint team with

Logo INRIA Saclay

Recent Publications

All the Dahu publications

S. Abiteboul, Y. Amsterdamer, D. Deutch, T. Milo and P. SenellartOptimal Probabilistic Generation of XML DocumentsTheory of Computing Systems, 2014. To appear. PDF | BibTeX )
S. Demri, A. K. Dhar and A. SangnierEquivalence Between Model-Checking Flat Counter Systems and Presburger ArithmeticIn RP'14, LNCS 8762, pages 85-97. Springer, September 2014. PDF | BibTeX )
S. Demri, D. Kapur and C. Weidenbach (eds.)Proceedings of the 7th International Joint Conference on Automated Reasoning (IJCAR'14), Vienna, Austria, July 2014, LNCS 8562. Springer. Web page | BibTeX )
S. Demri and M. DetersThe effects of modalities in separation logics (extended abstract)In AiML'14, pages 134-138. August 2014. PDF | BibTeX )
S. SchmitzImplicational Relevance Logic is 2-ExpTime-CompleteIn RTA/TLCA'14, LNCS 8560, pages 395-409. Springer, July 2014. Web page | PDF | BibTeX )

All the Dahu publications