On the Analysis of Queries with Counting Constraints

Everardo Barcenas-Patino 1 Pierre Genevès 1 Nabil Layaïda 1
1 WAM - Web, adaptation and multimedia
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : 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 static analysis of this combined XPath fragment allows to detect bugs in transformations and to perform many kinds of optimizations of document transformations. More precisely, we study how a logic for finite trees capable of expressing upward and downward recursive navigation, can be equipped with a counting operator along regular path expressions.
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/inria-00422964
Contributor : Vincent Quint <>
Submitted on : Friday, October 9, 2009 - 10:17:57 AM
Last modification on : Thursday, October 11, 2018 - 8:48:03 AM
Long-term archiving on : Tuesday, June 15, 2010 - 9:36:09 PM

File

DocEng09-Barcenas.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Everardo Barcenas-Patino, Pierre Genevès, Nabil Layaïda. On the Analysis of Queries with Counting Constraints. DocEng'09: Proceedings of the 2009 ACM Symposium on Document Engineering, Sep 2009, Munich, Germany. pp.21-24, ⟨10.1145/1600193.1600199⟩. ⟨inria-00422964⟩

Share

Metrics

Record views

667

Files downloads

228