Searching for "XML Typechecking." – sorted by Relevance.
-
Modulo Constraints and the Complexity of Typechecking XML Views
- Modulo Constraints and the Complexity of ⋆ ⋆⋆ Typechecking XML Views Jerzy Marcinkowski and Piotr
- Add To MetaCart
-
Towards practical typechecking for macro tree transducers
- Introduction Static typechecking for XML transformations is an important problem that expectedly has a
- Cited by 1 (0 self) – Add To MetaCart
-
ELEMENT sale-price(INTEGER))*,
- The XML Typechecking Problem Dan Suciu, University of Washington Presented by T.J. Green
- Add To MetaCart
-
Non-backtracking top-down algorithm for checking tree automata containment
- is the application to static typechecking for XML processing. XML [2] is a world-wide emerging standard
- Cited by 2 (2 self) – Add To MetaCart
-
Technischen Universit"at M"unchen Exact XML Type Checking in Polynomial Time
- as exact XML typechecking. In the exact setting it is common to use recognizable tree languages as type
- Add To MetaCart
-
Foundations of XML Processing
- automata and set operations on them. There are two separate approaches to XML typechecking, namely
- Add To MetaCart
-
Checking Satisfiability of Tree Pattern Queries for Active XML Documents
- XML typechecking problem [13] and optimize XPath based on DTD [8]. In [8], the authors defined a new
- Add To MetaCart

