Regular expression types for XML

Hosoya, Haruo; Vouillon, Jérôme; Pierce, Benjamin C.

doi:10.1145/1053468.1053470

Cited by 127 publications

(100 citation statements)

References 8 publications

Supporting

Mentioning

100

Contrasting

Order By: Relevance

“…For example, in the companion paper for this work [11], the authors define atoms such that they carry the type of message exchanged in a protocol. For example, if sorts are regular expression types for XML [27], the subsorting can be induced by a subtype system, which defines a preorder hence preserves consistency but increases time complexity since subtyping is EXPTIME-complete. In contrast, when sorts are any partial order over finite types (without recursive types) defined by a finite number of subtype inequalities [14], then the complexity class is also preserved.…”

Section: Choice or Withmentioning

confidence: 99%

The Consistency and Complexity of Multiplicative Additive System Virtual

Horne¹

2015

SACS

View full text Add to dashboard Cite

This paper investigates the proof theory of multiplicative additive system virtual (MAV). MAV combines two established proof calculi: multiplicative additive linear logic (MALL) and basic system virtual (BV). Due to the presence of the self-dual non-commutative operator from BV, the calculus MAV is defined in the calculus of structuresa generalisation of the sequent calculus where inference rules can be applied in any context. A generalised cut elimination result is proven for MAV, thereby establishing the consistency of linear implication defined in the calculus. The cut elimination proof involves a termination measure based on multisets of multisets of natural numbers to handle subtle interactions between operators of BV and MAV. Proof search in MAV is proven to be a PSPACE-complete decision problem. The study of this calculus is motivated by observations about applications in computer science to the verification of protocols and to querying.

show abstract

Section: Choice or Withmentioning

confidence: 99%

The Consistency and Complexity of Multiplicative Additive System Virtual

Horne¹

2015

SACS

View full text Add to dashboard Cite

show abstract

“…Type Constraints As an internal representation for tree grammars, we consider regular tree type expressions (in the manner of [Hosoya et al 2005]), extended with constraints over attributes. Assuming a set of variables ranged over by x, we define a tree type expression as follows:…”

Section: Xml Trees With Attributesmentioning

confidence: 99%

“…We use the usual semantics of regular tree types found in [Hosoya et al 2005] and [Genevès et al 2008].…”

Section: Xml Trees With Attributesmentioning

confidence: 99%

Identifying query incompatibilities with evolving XML schemas

2009

View full text Add to dashboard Cite

During the life cycle of an XML application, both schemas and queries may change from one version to another. Schema evolutions may affect query results and potentially the validity of produced data. Nowadays, a challenge is to assess and accommodate the impact of these changes in evolving XML applications. Such questions arise naturally in XML static analyzers. These analyzers often rely on decision procedures such as inclusion between XML schemas, query containment and satisfiability. However, existing decision procedures cannot be used directly in this context. The reason is that they are unable to distinguish information related to the evolution from information corresponding to bugs. This paper proposes a predicate language within a logical framework that can be used to make this distinction.We present a system for monitoring the effect of schema evolutions on the set of admissible documents and on the results of queries. The system is very powerful in analyzing various scenarios where the result of a query may not be anymore what was expected. Specifically, the system is based on a set of predicates which allow a fine-grained analysis for a wide range of forward and backward compatibility issues. Moreover, the system can produce counterexamples and witness documents which are useful for debugging purposes. The current implementation has been tested with realistic use cases, where it allows identifying queries that must be reformulated in order to produce the expected results across successive schema versions.

show abstract

“…Tree nodes are labeled with symbols taken from a finite 2 alphabet Σ. There is a straightforward isomorphism between sequences of unranked trees and binary trees (Hosoya et al, 2005;Neven, 2002). In order to describe it, we first define unranked trees as σ(h) where σ ∈ Σ and h is a hedge, i.e., a sequence of unranked trees, defined as follows:…”

Section: Logical Description Of Treesmentioning

confidence: 99%

Deciding XPath containment with MSO

Genevès¹,

Layaïda²

2007

Data & Knowledge Engineering

View full text Add to dashboard Cite

XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath fragment covers most of the language features used in practice. Specifically, we show how XPath queries can be translated into equivalent formulas in monadic second-order logic. Using this translation, we construct an optimized logical formulation of the containment problem, which is decided using tree automata. When the containment relation does not hold between two XPath expressions, a counter-example XML tree is generated. We provide practical experiments that illustrate the efficiency of the decision procedure for realistic scenarios.

show abstract

Regular expression types for XML

Cited by 127 publications

References 8 publications

The Consistency and Complexity of Multiplicative Additive System Virtual

The Consistency and Complexity of Multiplicative Additive System Virtual

Identifying query incompatibilities with evolving XML schemas

Deciding XPath containment with MSO

Contact Info

Product

Resources

About