Skip to Main content Skip to Navigation
Conference papers

Efficient Static Analysis of XML Paths and Types

Pierre Genevès 1, 2 Nabil Layaïda 2 Alan Schmitt 3
1 EPFL - Ecole Polytechnique Fédérale de Lausanne
2 WAM - Web, adaptation and multimedia
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
3 SARDES - System architecture for reflective distributed computing environments
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
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.
Keywords : xml path xpath types logic static analysis containment query equivalence satisfiability
Document type :
Conference papers
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download
https://hal.archives-ouvertes.fr/hal-00189123
Contributor : Pierre Genevès <>
Submitted on : Tuesday, November 20, 2007 - 5:34:46 PM
Last modification on : Thursday, November 19, 2020 - 1:00:26 PM
Long-term archiving on: : Monday, April 12, 2010 - 2:47:08 AM

File

Vignette du document
geneves-pldi07.pdf
Files produced by the author(s)

Identifiers

Collections

CNRS | INRIA | LIG | UGA

Citation

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

665

Files downloads

407