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

  • Authors:

  • Wim Martens;Frank Neven;Marc Gyssens

  • Affiliations:

  • Technical University of Dortmund, Lehrstuhl Informatik I, 44221 Dortmund, Germany;Hasselt University and Transnational University of Limburg, Agoralaan, Gebouw D, B-3590 Diepenbeek, Belgium;Hasselt University and Transnational University of Limburg, Agoralaan, Gebouw D, B-3590 Diepenbeek, Belgium

  • Venue:
  • Information and Computation
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.