XPath with Conditional Axis Relations

Marx, Maarten

doi:10.1007/978-3-540-24741-8_28

Cited by 74 publications

(155 citation statements)

References 23 publications

Supporting

Mentioning

151

Contrasting

Order By: Relevance

“…Hence, from a scientific viewpoint, we believe it makes sense to study the broader class of possibly non-deterministic but simple and practical regular expressions. Another consequence of our results, independent of the one-unambiguous issue, is that optimization problems for navigational queries as expressed by caterpillar expressions [5], X CPath reg and X reg [16], or regular path queries [6] quickly turn intractable. Due to space limitations many proofs are omitted.…”

Section: Introductionmentioning

confidence: 86%

Complexity of Decision Problems for Simple Regular Expressions

Martens

Neven

Schwentick

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the concatenation of factors where each factor is a disjunction of strings possibly extended with ' * ' or '?'. We obtain lower and upper bounds for various fragments of simple regular expressions. Although we show that inclusion and intersection are already intractable for very weak expressions, we also identify some tractable cases. For equivalence, we only prove an initial tractability result leaving the complexity of more general cases open. The main motivation for this research comes from database theory, or more specifically XML and semi-structured data. We namely show that all lower and upper bounds for inclusion and equivalence, carry over to the corresponding decision problems for extended context-free grammars and single-type tree grammars, which are abstractions of DTDs and XML Schemas, respectively. For intersection, we show that the complexity only carries over for DTDs.

show abstract

Section: Introductionmentioning

confidence: 86%

Complexity of Decision Problems for Simple Regular Expressions

Martens

Neven

Schwentick

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Following [21,22], we formalize XML documents as finite sibling trees, which are tree like structures, whose nodes are linked to each other by two relations: the child relation, connecting each node with its children in the tree; and the immediate-rightsibling relation, connecting each node with its sibling immediately to the right in the tree, such a relation models the order between the children of the node in an XML documents. Each node of the sibling tree is labeled by (possibly many) elements of a set of atomic propositions Σ.…”

Section: Regular Xpathmentioning

confidence: 99%

“…As in [21,22], we focus on a variant of XPath that allows for full regular expressions over the XPath axes. In fact, we make it explicit that such a variant of XPath is tightly related to Propositional Dynamic Logic (PDL) [1,15], and adopt the PDL syntax to express node and path expressions.…”

Section: Regular Xpathmentioning

confidence: 99%

“…As shown in [21] (see also Section 5 for dealing with identifiers), reasoning over RXPath formulas can be reduced to checking satisfiability in Propositional Dynamic Logics (PDLs). Specifically, one can resort to Repeat-Converse-Deterministic PDL (repeat-CDPDL), a variant of PDL that allows for expressing the finiteness of trees and for which satisfiability is EXPTIME-complete [30].…”

Section: Proposition 4 ([30]) a 2watamentioning

confidence: 99%

“…This paper introduces a powerful extension of CoreXPath, called RXPath, for expressing XML queries. Our language is inspired by the work carried out in the last few years on extensions of CoreXPath [29,21]. In particular, we extend CoreXPath with nominals, as well as with regular path expressions over XML trees, expressed as two-way regular expressions over XPath axes.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An Automata-Theoretic Approach to Regular XPath

Calvanese

Giacomo

Lenzerini

et al. 2009

Database Programming Languages

View full text Add to dashboard Cite

In this paper we present Regular XPath (RXPath), which is a natural extension of XPath with regular expressions over paths that has the same computational properties as XPath: linear-time query evaluation and exponential-time reasoning. To establish these results, we devise a unifying automata-theoretic framework based on two-way weak alternating tree automata. Specifically, we consider automata that have infinite runs on finite trees. This enables us to leverage and simplify existing automata-theoretic machinery and develop algorithms both for query evaluation and for reasoning over queries. With respect to the latter problem, we consider RXPath as a constraint language, and study constraint satisfiability, and query satisfiability and containment under constraints in the setting of RXPath.

show abstract

Generating and selecting resilient and maintainable locators for Web automated testing

Nguyen

Diep

2021

Software Testing Verif & Rel

View full text Add to dashboard Cite

Summary Web user interface (UI) test automation strategies have been dominated by programmable and record–playback approaches. Of these, record–playback allows creating automation tests easily and reduces the cost of test generation. However, this approach increases the cost of test maintenance due to its unstable generated locators for identifying UI objects during playback. In this paper, we propose a new approach to generating and selecting resilient and maintainable locators. Our approach consists of two parts, a new XPath construction method and selecting the best XPath to locate the target element. Our XPath construction method relies on semantic structures of Web pages to locate the target element using its neighbors. We conducted an experiment on 15 popular websites. The results show that our approach outperforms the state‐of‐the‐practice/art Selenium IDE and Robula+ in locating target elements by effectively avoiding wrong locators. It also produces more readable XPaths (hence more maintainable tests) than do these approaches.

show abstract

XPath with Conditional Axis Relations

Cited by 74 publications

References 23 publications

Complexity of Decision Problems for Simple Regular Expressions

Complexity of Decision Problems for Simple Regular Expressions

An Automata-Theoretic Approach to Regular XPath

Generating and selecting resilient and maintainable locators for Web automated testing

Contact Info

Product

Resources

About