Frontiers of tractability for typechecking simple XML transformations
From MaRDI portal
Publication:878753
DOI10.1016/j.jcss.2006.10.005zbMath1115.68058OpenAlexW2091686039MaRDI QIDQ878753
Publication date: 26 April 2007
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1942/608
Related Items (13)
Deciding definability by deterministic regular expressions ⋮ Cooperating Distributed Tree Automata ⋮ Well-definedness and semantic type-checking for the nested relational calculus ⋮ Visibly pushdown transducers ⋮ Automata for XML -- a survey ⋮ Look-ahead removal for total deterministic top-down tree transducers ⋮ Typechecking top-down XML transformations: Fixed input or output schemas ⋮ XML graphs in program analysis ⋮ On the complexity of typechecking top-down XML transformations ⋮ Modulo constraints and the complexity of typechecking XML views ⋮ Bottom-up unranked tree-to-graph transducers for translation into semantic graphs ⋮ A logic for document spanners ⋮ Unnamed Item
Uses Software
Cites Work
- On the complexity of typechecking top-down XML transformations
- Typechecking top-down XML transformations: Fixed input or output schemas
- An observation on time-storage trade off
- Typechecking for XML transformers
- XML with data values: Typechecking revisited.
- A comparison of pebble tree transducers with macro tree transducers
- A formal model for an expressive fragment of XSLT
- XPath satisfiability in the presence of DTDs
- CDuce
- Typechecking XML views of relational databases
- Mathematical Foundations of Computer Science 2004
- Containment and equivalence for a fragment of XPath
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Frontiers of tractability for typechecking simple XML transformations
