XPath is the standard language for navigating XML documents and returning a set of matching nodes. We present a sound and complete decision procedure for containment of XPath queries as well as other related XPath decision problems such as satisfiability, equivalence, overlap and coverage. The considered XPath fragment covers most of the language features used in practice. Specifically, we propose a unifying logic for XML, namely the alternation-free modal µ-calculus with converse. We show how to translate major XML concepts such as XPath and regular XML types (including DTDs) into this logic. Based on these embeddings, we show how XPath decision problems, in the presence or the absence of XML types, can be solved using a decision procedure for µ-calculus satisfiability. We provide a complexity analysis together with practical experiments of our system that illustrate the efficiency of the approach for realistic scenarios.
|
2483
|
Graph-based algorithms for Boolean function manipulation
– Bryant
- 1986
|
|
1581
|
Model Checking
– Clarke, Grumberg, et al.
- 1999
|
|
620
|
Design and synthesis of synchronization skeletons using branching time temporal logic
– Clarke, Emerson
- 1981
|
|
293
|
Propositional dynamic logic of regular programs
– Fischer, Ladner
- 1979
|
|
179
|
Results on the propositional µ-calculus
– Kozen
- 1983
|
|
157
|
Efficient algorithms for processing XPath queries
– Gottlob, Koch, et al.
- 2002
|
|
156
|
Regular path queries with constraints
– Abiteboul, Vianu
- 1997
|
|
151
|
Tree acceptors and some of their applications
– Doner
- 1970
|
|
132
|
Regular expression types for XML
– Hosoya, Vouillon, et al.
- 2000
|
|
118
|
Taxonomy of xml schema languages using formal language theory
– Murata, Lee, et al.
- 2001
|
|
117
|
Generalized finite automata theory with an application to a decision problem of second-order logic
– Thatcher, Wright
- 1968
|
|
88
|
Minimization of tree pattern queries
– Amer-Yahia, Cho, et al.
- 2001
|
|
78
|
Reasoning about the past with two-way automata
– Vardi
- 1998
|
|
73
|
XML Path Language (XPath) version 1.0 w3c recommendation
– Clark, DeRose
- 1999
|
|
70
|
XPath containment in the presence of disjunction, DTDs, and variables
– Neven, Schwentick
- 2003
|
|
59
|
Automata theory for XML researchers
– Neven
- 2002
|
|
39
|
Some classes of recursive functions
– Grzegorczyk
- 1953
|
|
38
|
Conditional XPath, the first order complete XPath dialect
– Marx
- 2004
|
|
37
|
Containment and equivalence for a fragment of XPath
– Miklau, Suciu
- 2004
|
|
34
|
XPath with conditional axis relations
– Marx
- 2004
|
|
33
|
Synchronized Multimedia Integration Language (SMIL) 1.0 Specification
– Hoschka
- 1998
|
|
31
|
Two semantics for XPath
– Wadler
- 2000
|
|
29
|
XPath satisfiability in the presence of DTDs
– Benedikt, Fan, et al.
- 2005
|
|
29
|
XHTML 1.0: The Extensible HyperText Markup Language
– Pemberton
- 2000
|
|
28
|
Secure XML querying with security views
– Fan, Chan, et al.
- 2004
|
|
28
|
Towards static type checking for XSLT
– Tozawa
- 2001
|
|
28
|
On the equivalence of XML patterns
– Wood
- 2000
|
|
24
|
Early quantification and partitioned transition relations
– Hojati, Krishnan, et al.
- 1996
|
|
24
|
Frontiers of tractability for typechecking simple XML transformations
– Martens, Neven
- 2004
|
|
23
|
Fixed point characterization of weak monadic logic definable sets of trees
– Arnold, Niwi'nski
- 1992
|
|
21
|
XPath query containment
– Schwentick
- 2004
|
|
20
|
BDD-Based Decision Procedures for K
– Pan, Sattler, et al.
- 2002
|
|
16
|
The inverse method implements the automata approach for modal satisfiability
– Baader, Tobies
- 2001
|
|
16
|
UpdateX - an XQuery-based language for processing updates
– Sur, Hammer, et al.
- 2004
|
|
14
|
Containment of Regular Path Expressions under Integrity Constraints
– Deutsch, Tannen
- 2001
|
|
13
|
Type-based optimization for regular patterns
– Levin, Pierce
- 2005
|
|
12
|
XPathMark: An XPath benchmark for the XMark generated data
– Franceschet
- 2005
|
|
11
|
Temporal logics over unranked trees
– Barceló, Libkin
- 2005
|
|
10
|
Rijke. PDL for ordered trees
– Afanasiev, Blackburn, et al.
- 2005
|
|
10
|
Regular tree languages definable in FO
– Benedikt, Segoufin
- 2005
|
|
7
|
Logic-based XPath optimization
– Genevès, Vion-Dury
- 2004
|
|
7
|
A decision procedure for the alternation-free two-way modal µ-calculus
– Tanabe, Takahashi, et al.
- 2005
|
|
6
|
The weakness of self-complementation
– Kupferman, Vardi
- 1999
|
|
5
|
XPath formal semantics and beyond: A Coq-based approach
– Genevès, Vion-Dury
- 2004
|
|
5
|
A finite model theorem for the propositional µ-calculus
– Kozen
- 1988
|
|
4
|
Automata, Logics and Infinite Games: A Guide to Current Research, volume 2500 of LNCS
– Grädel, Thomas, et al.
- 2002
|
|
3
|
XML path language (XPath) 2.0, W3C candidate recommendation
– Berglund, Boag, et al.
- 2006
|
|
1
|
A µ-calculus satisfiability solver for XML. http://wam.inrialpes.fr/xml
– Genevès, Layaïda
- 2006
|
|
1
|
A System for the Static Analysis of XPath · 137
– Hopcroft, Motwani, et al.
- 2000
|
