Exact XML type checking in polynomial time

  • Authors:

  • Sebastian Maneth;Thomas Perst;Helmut Seidl

  • Affiliations:

  • National ICT Australia and School of Computer Science and Engineering, UNSW, Sydney Research Lab, Sydney, Australia;Technische Universität München, Garching, Germany;Technische Universität München, Garching, Germany

  • Venue:
  • ICDT'07 Proceedings of the 11th international conference on Database Theory
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts. While the problem is decidable, the involved technique of inverse type inference is known to have exponential worst-case complexity (already for top-down transformations without parameters). We present a new adaptive type checking algorithm based on forward type inference through exact characterizations of output languages. The new algorithm correctly type-checks all call-by-value smtts. Given that the output type is specified by a deterministic automaton, the algorithm is polynomial-time whenever the transducer uses only few parameters and visits every input node only constantly often. Our new approach can also be generalized from smtts to stay macro forest transducers which additionally support concatenation as built-in output operation.