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.
Type de document :
Communication dans un congrès
DocEng'09: Proceedings of the 2009 ACM Symposium on Document Engineering, Sep 2009, Munich, Germany. ACM, pp.21-24, 2009, <10.1145/1600193.1600199>
Liste complète des métadonnées

https://hal.inria.fr/inria-00422964
Contributeur : Vincent Quint <>
Soumis le : vendredi 9 octobre 2009 - 10:17:57
Dernière modification le : mercredi 30 décembre 2009 - 15:30:12
Document(s) archivé(s) le : mardi 15 juin 2010 - 21:36:09

Fichier

DocEng09-Barcenas.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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. ACM, pp.21-24, 2009, <10.1145/1600193.1600199>. <inria-00422964>

Partager

Métriques

Consultations de
la notice

215

Téléchargements du document

106