Sciweavers

Share
CORR
2006
Springer

On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas

8 years 5 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 general setting, both the input and output schema as well as the transformation are part of the input for the problem. However, scenarios where the input or output schema can be considered to be fixed, are quite common in practice. In the present work, we investigate the computational complexity of the typechecking problem in the latter setting. Key words: XML, XSLT, tree transformations, typechecking, unranked tree transducers, complexity
Wim Martens, Frank Neven, Marc Gyssens
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where CORR
Authors Wim Martens, Frank Neven, Marc Gyssens
Comments (0)
books