Sciweavers

662 search results - page 6 / 133
» Trees, Automata and XML
Sort
View
DKE
2007
136views more  DKE 2007»
15 years 1 months ago
Deciding XPath containment with MSO
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 f...
Pierre Genevès, Nabil Layaïda
ICDT
2012
ACM
226views Database» more  ICDT 2012»
13 years 4 months ago
Bounded repairability for regular tree languages
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
Gabriele Puppis, Cristian Riveros, Slawek Staworko
ICDT
2003
ACM
126views Database» more  ICDT 2003»
15 years 7 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 12 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
LICS
2012
IEEE
13 years 4 months ago
An Automata Model for Trees with Ordered Data Values
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
Tony Tan