Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Pierre Genevès
2010 – today
- 2013
[c20]Pierre Genevès, Nabil Layaïda: XML validation: looking backward - strongly typed and flexible XML processing are not incompatible. WWW (Companion Volume) 2013: 219-220- 2012
[c19]Melisachew Wudage Chekol, Jérôme Euzenat, Pierre Genevès, Nabil Layaïda: SPARQL Query Containment Under SHI Axioms. AAAI 2012
[c18]Melisachew Wudage Chekol, Jérôme Euzenat, Pierre Genevès, Nabil Layaïda: SPARQL Query Containment under RDFS Entailment Regime. IJCAR 2012: 134-148
[c17]Muhammad Junedi, Pierre Genevès, Nabil Layaïda: XML query-update independence analysis revisited. ACM Symposium on Document Engineering 2012: 95-98
[c16]Raquel Oliveira, Pierre Genevès, Nabil Layaïda: Toward automated schema-directed code revision. ACM Symposium on Document Engineering 2012: 103-106
[c15]Pierre Genevès, Nabil Layaïda, Vincent Quint: On the analysis of cascading style sheets. WWW 2012: 809-818- 2011
[j4]Pierre Genevès, Nabil Layaïda, Vincent Quint: Impact of XML Schema Evolution. ACM Trans. Internet Techn. 11(1): 4 (2011)
[c14]Nils Gesbert, Pierre Genevès, Nabil Layaïda: Parametric polymorphism and semantic subtyping: the logical connection. ICFP 2011: 107-116
[c13]
[c12]Everardo Bárcenas, Pierre Genevès, Nabil Layaïda, Alan Schmitt: Query Reasoning on Trees with Types, Interleaving, and Counting. IJCAI 2011: 718-723- 2010
[c11]
[c10]
[c9]
[i5]Everardo Bárcenas, Pierre Genevès, Nabil Layaïda, Alan Schmitt: A Tree Logic with Graded Paths and Nominals. CoRR abs/1005.5623 (2010)
[i4]Everardo Bárcenas, Pierre Genevès, Nabil Layaïda, Alan Schmitt: On the Count of Trees. CoRR abs/1008.5073 (2010)
2000 – 2009
- 2009
[c8]Everardo Bárcenas, Pierre Genevès, Nabil Layaïda: On the analysis of queries with counting constraints. ACM Symposium on Document Engineering 2009: 21-24
[c7]Pierre Genevès, Nabil Layaïda, Vincent Quint: Identifying query incompatibilities with evolving XML schemas. ICFP 2009: 221-230- 2008
[j3]
[i3]
[i2]Pierre Genevès, Nabil Layaïda, Vincent Quint: Ensuring Query Compatibility with Evolving XML Schemas. CoRR abs/0811.4324 (2008)
[i1]- 2007
[j2]Pierre Genevès, Nabil Layaïda: Deciding XPath containment with MSO. Data Knowl. Eng. 63(1): 108-136 (2007)
[c6]Pierre Genevès, Nabil Layaïda, Alan Schmitt: XPath Typing Using a Modal Logic with Converse for Finite Trees. PLAN-X 2007: 61-72
[c5]Pierre Genevès, Nabil Layaïda, Alan Schmitt: Efficient static analysis of XML paths and types. PLDI 2007: 342-351- 2006
[j1]Pierre Genevès, Nabil Layaïda: A system for the static analysis of XPath. ACM Trans. Inf. Syst. 24(4): 475-502 (2006)
[c4]Pierre Genevès, Nabil Layaïda: Comparing XML path expressions. ACM Symposium on Document Engineering 2006: 65-74- 2005
[c3]Pierre Genevès, Kristoffer Høgsbro Rose: Compiling XPath for streaming access policy. ACM Symposium on Document Engineering 2005: 52-54- 2004
[c2]Pierre Genevès, Jean-Yves Vion-Dury: Logic-based XPath optimization. ACM Symposium on Document Engineering 2004: 211-219
[c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-26 22:02 CEST by the dblp team



