Regular expression types for XML

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

doi:10.1145/351240.351242

Cited by 138 publications

(86 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hosoya et al [8] study the inclusion problem for XML Schemas. They also use a syntax-directed inference system, but the algorithm is not polynomial-time.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

The Inclusion Problem for Regular Expressions

Hovland

2010

Language and Automata Theory and Applications

View full text Add to dashboard Cite

Abstract. This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automata, and can therefore be faster than the lower bound implied by the Myhill-Nerode theorem. The algorithm automatically discards unnecessary parts of the right-hand expression. In these cases the right-hand expression might even be 1-ambiguous. For example, if r is a regular expression such that any DFA recognizing r is very large, the algorithm can still, in time independent of r, decide that the language of ab is included in that of (a + r)b. The algorithm is based on a syntax-directed inference system. It takes arbitrary regular expressions as input, and if the 1-ambiguity of the right-hand expression becomes a problem, the algorithm will report this.

show abstract

“…Hosoya et al [8] study the inclusion problem for XML Schemas. They also use a syntax-directed inference system, but the algorithm is not polynomial-time.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

The Inclusion Problem for Regular Expressions

Hovland

2010

Language and Automata Theory and Applications

View full text Add to dashboard Cite

show abstract

“…We adapt regular expression types (RE types) [9] to summarize a set of values. Our RE types are similar to DTDs or XML-Schema, with two distinctions: (1) we disallow recursion, and (2) we restrict them to our data model, which contains no attributes.…”

Section: Abstract Provenance Flowgraphsmentioning

confidence: 99%

Abstract Provenance Graphs: Anticipating and Exploiting Schema-Level Data Provenance

Zinn

Ludäscher

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Provenance graphs capture flow and dependency information recorded during scientific workflow runs, which can be used subsequently to interpret, validate, and debug workflow results. In this paper, we propose the new concept of Abstract Provenance Graphs (APGs). APGs are created via static analysis of a configured workflow W and input data schema, i.e., before W is actually executed. They summarize all possible provenance graphs the workflow W can create with input data of type , that is, for each input v ¾ there exists a graph homomorphism À v between the concrete and abstract provenance graph. APGs are helpful during workflow construction since (1) they make certain workflow design-bugs (e.g., selecting none or wrong input data for the actors) easy to spot; and (2) show the evolution of the overall data organization of a workflow. Moreover, after workflows have been run, APGs can be used to validate concrete provenance graphs. A more detailed version of this work is available as [14]. 1

show abstract

“…The idea is similar to that of [10] (see the discussion at the end of this section) and is motivated by DTD's and by XML Schema.…”

Section: Specifying Sets Of Data Termsmentioning

confidence: 99%

“…To specify such types a formalism of regular expression types is proposed in [10] and inclusion subtyping is discussed. Checking of the subtyping relations can then be reduced to checking inclusion of sets specified by regular tree grammars [8].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On Subtyping of Tree-Structured Data: A Polynomial Approach

Bry

Drabent

Maluszynski

2004

Principles and Practice of Semantic Web Reasoning

View full text Add to dashboard Cite

Abstract. This paper discusses subtyping of tree-structured data encountered on the Web, e.g. XML and HTML data. Our long range objective is to define a type system for Web and/or Semantic Web query languages amenable to static type checking. We propose a type formalism motivated by XML Schema and accommodating two concepts of subtyping: inclusion subtyping (corresponding to XML Schema notion of type restriction) and extension subtyping (motivated by XML Schema's type extension). We present algorithms for checking both kinds of subtyping. The algorithms are polynomial if certain conditions are imposed on the type definitions; the conditions seem natural and not too restrictive.

show abstract

Regular expression types for XML

Cited by 138 publications

References 10 publications

The Inclusion Problem for Regular Expressions

The Inclusion Problem for Regular Expressions

Abstract Provenance Graphs: Anticipating and Exploiting Schema-Level Data Provenance

On Subtyping of Tree-Structured Data: A Polynomial Approach

Contact Info

Product

Resources

About