#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2008

2017

- This year (1)
- Last 5 years (12)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Everardo Bárcenas, Pierre Genevès, Nabil Layaïda, Alan Schmitt
- IJCAI
- 2011

A major challenge of query language design is the combination of expressivity with effective static analyses such as query containment. In the setting of XML, documents are seen as finite trees, whose structure may additionally be constrained by type constraints such as those described by an XML schema. We consider the problem of query containment in the… (More)

- Everardo Bárcenas, José de Jesús Lavalle-Martínez
- Logical Methods in Computer Science
- 2014

We introduce a logical foundation to reason on tree structures with constraints on the number of node occurrences. Related formalisms are limited to express occurrence constraints on particular tree regions, as for instance the children of a given node. By contrast, the logic introduced in the present work can concisely express numerical bounds on any… (More)

We propose a tree logic capable of expressing simple cardinality constraints on the number of nodes selected by an arbitrarily deep regular path with backward navigation. Specifically, a sublogic of the alternation-free μ−calculus with converse for finite trees is extended with a counting operator in order to reason on the cardinality of node sets. Also, we… (More)

- Everardo Bárcenas, Pierre Genevès, Nabil Layaïda
- ACM Symposium on Document Engineering
- 2009

We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select portions of documents subject to transformations. We explore how recent results on the static analysis of navigational aspects of XPath can be extended to counting constraints. The… (More)

- Everardo Bárcenas, Pierre Genevès, Nabil Layaïda, Alan Schmitt
- ArXiv
- 2010

Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on frameworks for reasoning about path expressions where node cardinality constraints occur along a path in a tree. We present a logic capable of expressing deep counting… (More)

- Everardo Bárcenas
- Computación y Sistemas
- 2015

It has been recently shown that the fully enriched μ-calculus, an expressive modal logic, is undecidable. In the current work, we prove that this result does not longer hold when considering finite tree models. This is achieved with the introduction of an extension of the fully enriched μ-calculus for trees with numerical constraints. Contrastively with… (More)

Regular path expressions represent the navigation core of the XPath query language for semi-structured data (XML), and it has been characterized as the First Order Logic with Two Variables (FO). Data tests refers to (dis)equality comparisons on data tree models, which are unranked trees with two kinds of labels, propositions from a finite alphabet, and data… (More)