On the complexity of typechecking top-down XML transformations.

AllImages Videos Books Maps News Shopping

Did you mean: On the complexity of type checking top-down XML transformations.

On the complexity of typechecking top-down XML transformations

www.researchgate.net › publication › 22...

Oct 22, 2024 · We focus on simple top-down recursive transformations motivated by XSLT and structural recursion on trees. We parameterize the problem by ...

On the complexity of typechecking top-down XML transformations

www.sciencedirect.com › article › pii

We investigate the typechecking problem for XML transformations: statically verifying that every answer to a transformation conforms to a given output ...

[PDF] On the Complexity of Typechecking Top-Down XML Transformations

www.theoinf.uni-bayreuth.de › pool

We investigate the typechecking problem for XML transformations: statically ver- ifying that every answer to a transformation conforms to a given output ...

On Typechecking Top-Down XML Tranformations: Fixed Input ... - arXiv

arxiv.org › cs

Jun 22, 2006 · Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given ...

On Typechecking Top-Down XML Tranformations - NASA ADS

ui.adsabs.harvard.edu › abs › abstract

Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given ...

Typechecking top-down XML transformations: Fixed input or ...

www.sciencedirect.com › article › pii

Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given ...

[PDF] On Typechecking Top-Down XML Tranformations: Fixed Input ...

www.semanticscholar.org › paper

This work investigates the computational complexity of the typechecking problem in the latter setting of scenarios where the input or output schema can be ...

[PDF] Typechecking Top-Down XML Tranformations : Fixed Input or ...

www.semanticscholar.org › paper › Type...

This work investigates the computational complexity of the typechecking problem in the latter setting of scenarios where the input or output schema can be ...

Typechecking top-down XML transformations: Fixed input or output ...

dl.acm.org › doi › abs › j.ic.2008.01.002

Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given ...

Typechecking Top-Down XML Transformations

www.theoinf.uni-bayreuth.de › Paper2003

Typechecking is complete for the complexity classes shown here. Typechecking Top-Down XML Transformations – p.16/24. Page 47. Tree Automata: Toolbox. We can ...