Efficient Static Analysis of XML Paths and Types - Archive ouverte HAL Access content directly
Conference Papers Year : 2007

Efficient Static Analysis of XML Paths and Types


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.
Fichier principal
Vignette du fichier
geneves-pldi07.pdf (280.54 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00189123 , version 1 (20-11-2007)



Pierre Genevès, Nabil Layaïda, Alan Schmitt. Efficient Static Analysis of XML Paths and Types. Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation, Jun 2007, San Diego, United States. pp.342--351, ⟨10.1145/1250734.1250773⟩. ⟨hal-00189123⟩
269 View
163 Download



Gmail Facebook Twitter LinkedIn More