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

Simple item page
dc.creatorMartens, Wim
dc.creatorNeven, Frank
dc.creatorGyssens, Marc
dc.date2006-06-22
dc.date.accessioned2026-07-07T07:13:06Z
dc.date.available2026-07-07T07:13:06Z
dc.descriptionTypechecking 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.
dc.identifierhttps://arxiv.org/abs/cs/0606094
dc.identifierhttp://arxiv.org/abs/cs/0606094
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/112324
dc.subjectDatabases
dc.subjectProgramming Languages
dc.titleOn Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas
dc.typetext

Files

Collections

arXiv