@inproceedings{Barcenas09b,
  author = {Everardo Bárcenas and Pierre Genevès and Nabil Layaïda},
  title = {On the Analysis of Queries with Counting Constraints},
  booktitle = {DocEng'09: Proceedings of the Ninth ACM Symposium on
                Document Engineering},
  publisher = {ACM},
  isbn = {978-1-60558-575-8},
  location = {Munich, Germany},
  month = sep,
  year = 2009,
  pages = {21--24},
  url = {http://wam.inrialpes.fr/publications/2009/DocEng09-Barcenas.pdf},
  url2 = {http://hal.inria.fr/inria-00422964/},
  doi = {http://doi.acm.org/10.1145/1600193.1600199},
  x-proceedings = {yes},
  x-international-audience = {yes},
  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.}
}