Efficient Static Analysis of XML Paths and Types - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2008

Efficient Static Analysis of XML Paths and Types

Abstract

We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically type-check XPath queries. To this end, we prove the decidability of a logic with converse for finite ordered trees whose time complexity is a simple exponential of the size of a formula. The logic corresponds to the alternation free modal mu-calculus without greatest fixpoint, restricted to finite trees, and where formulas are cycle-free. Our proof method is based on two auxiliary results. First, XML regular tree types and XPath expressions have a linear translation to cycle-free formulas. Second, the least and greatest fixpoints are equivalent for finite trees, hence the logic is closed under negation. Building on these results, we describe a practical, effective system for solving the satisfiability of a formula. The system has been experimented with some decision problems such as XPath emptiness, containment, overlap, and coverage, with or without type constraints. The benefit of the approach is that our system can be effectively used in static analyzers for programming languages manipulating both XPath expressions and XML type annotations (as input and output types).
Fichier principal
Vignette du fichier
RR-6590.pdf (553.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00305302 , version 1 (23-07-2008)
inria-00305302 , version 2 (23-07-2008)
inria-00305302 , version 3 (24-07-2008)

Identifiers

  • HAL Id : inria-00305302 , version 3

Cite

Pierre Genevès, Nabil Layaïda, Alan Schmitt. Efficient Static Analysis of XML Paths and Types. [Research Report] RR-6590, INRIA. 2008. ⟨inria-00305302v3⟩
218 View
225 Download

Share

Gmail Facebook X LinkedIn More