 |
Free and accessible knowledge |
Conference papers
Efficient Static Analysis of XML Paths and Types
Abstract : A new logic for reasoning over finite trees is proposed. This logic currently offers the best balance known between expressivity and complexity for decidability. It is as expressive as monadic second-order logic whereas its satisfiability is shown decidable in time complexity 2^O(n) w.r.t. size n of the formula. We present an effective algorithm in practice using symbolic techniques (BDDs), and use it for the static analysis of XPath queries in the presence of regular tree types, including XPath typing.
Cited literature [29 references]
https://hal.archives-ouvertes.fr/hal-00189123
Contributor : Pierre Genevès Connect in order to contact the contributor
Submitted on : Tuesday, November 20, 2007 - 5:34:46 PM
Last modification on : Wednesday, April 6, 2022 - 3:48:02 PM
Long-term archiving on: : Monday, April 12, 2010 - 2:47:08 AM
Contributor : Pierre Genevès Connect in order to contact the contributor
Submitted on : Tuesday, November 20, 2007 - 5:34:46 PM
Last modification on : Wednesday, April 6, 2022 - 3:48:02 PM
Long-term archiving on: : Monday, April 12, 2010 - 2:47:08 AM
File
geneves-pldi07.pdf
Files produced by the author(s)