| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
On the Analysis of Queries with Counting Constraints
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.
Cited literature [10 references]
https://hal.inria.fr/inria-00422964
Contributor : Vincent Quint <>
Submitted on : Friday, October 9, 2009 - 10:17:57 AM
Last modification on : Thursday, November 19, 2020 - 1:00:20 PM
Long-term archiving on: : Tuesday, June 15, 2010 - 9:36:09 PM
Contributor : Vincent Quint <>
Submitted on : Friday, October 9, 2009 - 10:17:57 AM
Last modification on : Thursday, November 19, 2020 - 1:00:20 PM
Long-term archiving on: : Tuesday, June 15, 2010 - 9:36:09 PM
File
DocEng09-Barcenas.pdf
Files produced by the author(s)