Research Scientists
Citations
| 1011 | publications by the team in recent years - Major |
| 79 | Two-variable logic on words with data - Bojanczyk, David, et al. |
| 75 | LTL with the freeze quantifier and register automata - Demri, Lazić - 2009 |
| 35 | A rule-based language for web data management
- Abiteboul, Bienvenu, et al.
- 2011
(Show Context)
Citation Context ...egrated setting. To support automatic reasoning on this knowledge base, we also introduced a novel rule-based language supporting the exchange of rules, namely Webdamlog. This work has been presented =-=[21]-=- and demonstrated [26] at major database conferences. Probabilistic XML. Data from the Web are imprecise and uncertain. To manage this imprecision in a well-principled way, we have made significant ad... |
| 26 | Data exchange and schema mappings in open and closed worlds
- Libkin, Sirangelo
- 2008
(Show Context)
Citation Context ...roposed and analyzed a new language to specify data restructuring rules (schema mappings). This language generalizes existing mapping dependencies, by allowing a more flexible specification mechanism =-=[20]-=-. Jorge. We also invested a lot of effort in a textbook (undergraduate and graduate level) on Web data management (nicknamed Jorge) to be published at Cambridge University Press [38]. The book is alre... |
| 25 | XPath, transitive closure logic, and nested tree walking automata. - Cate, Segoufin - 2008 |
| 25 | Reasoning about XML with temporal logics and automata. - Libkin, Sirangelo - 2010 |
| 18 | Towards a characterization of order-invariant queries over tame structures - Benedikt, Segoufin |
| 15 | Reasoning about XML Update Constraints. In: - Cautis, Abiteboul, et al. - 2007 |
| 15 | Guarded negation - Bárány, Cate, et al. - 2011 |
| 15 | Bottom-up automata on data trees and vertical XPath
- Figueira
(Show Context)
Citation Context ...er on some data. In general, in the presence of data values, the satisfiability of XPath is undecidable. We have shown that when restricted to its vertical navigational power, XPath becomes decidable =-=[30]-=-. 5.2. Distributed data management Participants: Serge Abiteboul, Emilien Antoine, Daniel Deutch, Alban Galland, Wojciech Kazana, Yannis Katsis, Luc Segoufin, Cristina Sirangelo. Distributed knowledge... |
| 12 | Regular tree languages definable - Benedikt, Segoufin |
| 11 | Reasoning about sequences of memory states - Brochenin, Demri, et al. - 2007 |
| 8 | Distributed XML design, in - Abiteboul, Gottlob, et al. |
| 8 | Comparing workflow specification languages: a matter of views
- Abiteboul, Bourhis, et al.
- 2011
(Show Context)
Citation Context ...that may be active, so may activate new subtasks. Our first line of result is a comparison of the specification power of various workflow control mechanisms within the Active XML framework and beyond =-=[23]-=-. Project-Team DAHU 3 AXML is very powerful and many static analysis problems are undecidable. We have also introduced a model of automata designed for modeling infinite runs of systems equipped with ... |
| 8 | L.: Unary negation - Cate, Segoufin |
| 8 | Growing triples on trees: An XML-RDF hybrid model for annotated documents. - Goasdoué, Karanasos, et al. - 2013 |
| 7 | First-order query evaluation on structures of bounded degree
- Kazana, Segoufin
- 2011
(Show Context)
Citation Context ...econd time interval is known as the delay. We have shown that this was doable with a linear preprocessing time and constant enumeration delay for first-order queries over structures of bounded degree =-=[19]-=-. Data exchange and Web incomplete information. We have addressed the problem of restructuring data exchanged between communicating applications on the Web. We have proposed and analyzed a new languag... |
| 7 | Web information management with access control - Abiteboul, Galland, et al. - 2011 |
| 7 | Automata based verification over linearly ordered data domains
- SEGOUFIN, TORUNCZYK
- 2011
(Show Context)
Citation Context ...at different times of the run. The main contribution of the work is the proof that automated verification of such temporal properties of the system can be carried out in PSpace. For more details, see =-=[35]-=-. Static analysis of query languages. XPath is arguably the most widely used XML query language as it is implemented in XSLT and XQuery and it is used as a constituent part of several specification an... |
| 6 | Two-variable logic on data trees and applications to XML reasoning - Schwentick, Segoufin |
| 5 | Capturing continuous data and answering aggregate queries in probabilistic XML
- Abiteboul, Chan, et al.
(Show Context)
Citation Context ...ied out in-depth studies of query evaluation, aggregation, and updates in various probabilistic XML models. These results have matured and some of the results are available in journal articles, e.g., =-=[14]-=-. Enumeration of query answers. In many applications the output of a query may have a huge size and enumerating all the answers may already consume too many of the allowed resources. In this case it m... |
| 5 | On the equivalence of distributed systems with queries and communication - Abiteboul, Cate, et al. - 2011 |
| 4 | Static Analysis of Active XML - ABITEBOUL, SEGOUFIN, et al. |
| 4 | Sufficient completeness verification for conditional and constrained term rewriting systems. - Bouhoula, Jacquemard - 2012 |
| 4 | Locality of queries definable in invariant first-order logic with arbitrary built-in predicates - Anderson, Melkebeek, et al. - 2011 |
| 4 | S.: Watermarking for ontologies - Suchanek, Gross-Amblard, et al. |
| 3 | The Effects of Bounding Syntactic Resources on - DEMRI, GASCON |
| 3 | The complexity of reversal-bounded modelchecking - Bersani, Demri - 2011 |
| 2 |
Rigid Tree Automata and Applications, in "Information and Computation", 2010
- JACQUEMARD, KLAY, et al.
(Show Context)
Citation Context ... used for testing monadic key constraints over XML documents. For these models, the main challenge is to establish the decidability of the non-emptiness of the language specified by a given automaton =-=[18]-=-. Rewriting Controlled by Selection Automata. Motivated by the problem of static analysis of XML update programs, we have studied [33] the combination, called controlled term rewriting systems (CTRS),... |
| 2 | Formalisation des relations temporelles entre une partition et une performance musicale dans un contexte d’accompagnement automatique, in "Actes du 8eme Colloque sur la Modélisation des Systèmes Réactifs (MSR’11 - ECHEVESTE, CONT, et al. - 2011 |
| 1 | On the Dynamics of Active Documents for Distributed Data Management, Université Paris-Sud - BOURHIS - 2011 |
| 1 | Distributed Data Management with Access Control, Université Paris-Sud - GALLAND - 2011 |
| 1 | Extended Tree Automata for the Verification of Infinite Systems, École Normale Supérieure de - JACQUEMARD |
| 1 | Controlled Term Rewriting
- JACQUEMARD, KOJIMA, et al.
(Show Context)
Citation Context ... the non-emptiness of the language specified by a given automaton [18]. Rewriting Controlled by Selection Automata. Motivated by the problem of static analysis of XML update programs, we have studied =-=[33]-=- the combination, called controlled term rewriting systems (CTRS), of term rewriting rules with constraints selecting the possible rewrite positions. These constraints are specified, for each rewrite ... |
| 1 | Multiple Congruence Relations, First-Order Theories on Terms, and the Frames of the Applied Pi-Calculus, in "Theory of Security and Applications (TOSCA, affiliated to ETAPS - JACQUEMARD, LOZES, et al. - 2011 |
| 1 |
Verification of Infinite-State Systems, in "Models and Analysis for Distributed Systems
- DEMRI, POITRENAUD
(Show Context)
Citation Context ...s emptiness problem [30]. These automata were used for obtaining decidability results for the static analysis for some fragments of XPath presented in the previous section. Automata with counters. In =-=[39]-=-, a survey chapter on the verification of infinite-state systems is presented that is focused on the verification of counter systems. Verification problems for vector addition systems and recursive Pe... |
