Sciweavers

677 search results - page 1 / 136
» The XML Typechecking Problem
Sort
View
47
Voted
SIGMOD
2002
ACM
78views Database» more  SIGMOD 2002»
15 years 10 months ago
The XML Typechecking Problem
Dan Suciu
PODS
2004
ACM
86views Database» more  PODS 2004»
15 years 10 months ago
Frontiers of Tractability for Typechecking Simple XML Transformations
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...
Wim Martens, Frank Neven
CORR
2006
Springer
88views Education» more  CORR 2006»
14 years 10 months ago
On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas
Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. In this ge...
Wim Martens, Frank Neven, Marc Gyssens
ICDT
2003
ACM
126views Database» more  ICDT 2003»
15 years 3 months ago
Typechecking Top-Down Uniform Unranked Tree Transducers
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
Wim Martens, Frank Neven
PPDP
2010
Springer
14 years 7 months ago
Rewrite-based verification of XML updates
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
Florent Jacquemard, Michaël Rusinowitch