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.
Permanent Members | ||
| Serge Abiteboul Senior researcher, INRIA Saclay-Île de France | Florent Jacquemard Researcher, INRIA | Cristina Sirangelo Assistant professor, ENS Cachan |
| Stéphane Demri Senior researcher, CNRS | Luc Segoufin Senior researcher, INRIA | |
Associated and Temporary Members | ||
| Yannis Katsis Researcher, INRIA Saclay-Île de France | ||
Ph.D. Students | ||
| Pierre Bourhis PhD student, INRIA | Alban Galland PhD student, INRIA | Thomas Place PhD student, ENS Cachan |
| Diego Figueira PhD student, INRIA | Wojciech Kazana PhD student, INRIA | |
A joint team with
| • | . Complexity of Modal Logics with Presburger Constraints. Journal of Applied Logic, 2010. To appear. ( PDF | BibTeX ) |
| • | . Reasoning about XML with temporal logics and automata. Journal of Applied Logic 8(2), pages 210-232, 2010. ( PDF | BibTeX ) |
| • | . Model checking memoryful linear-time logics over one-counter automata. Theoretical Computer Science, 2010. To appear. ( PDF | BibTeX ) |
| • | . Transitive Closure Logic, Nested Tree Walking Automata, and XPath. Journal of the ACM, 2010. To appear. ( PDF | BibTeX ) |
| • | . Two-variable logic on data trees and applications to XML reasoning. Journal of the ACM 56(3), 2009. ( PDF | BibTeX ) |