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.
Associated and Temporary Members
A joint team with
|•||. The limits of Neciporuk's method and the power of programs over monoids taken from small varieties of finite monoids. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, September 2018. ( PDF | BibTeX )|
|•||. Une base de connaissance personnelle intégrant les données d'un utilisateur et une chronologie de ses activités. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, March 2017. ( PDF | BibTeX )|
|•||. Bottom-up automata on data trees and vertical XPath. Logical Methods in Computer Science 13(4:5), October 2017. ( BibTeX )|
|•||. Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS'16). In PODS'16, pages 179-194. ACM Press, June 2016. ( BibTeX )|
|•||. View-based Query Determinacy and Rewritings over Graph Databases. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2015. ( Web page | BibTeX )|