@inproceedings{331f11252e544fbea3bf018c044bad75,
title = "Exact XML type checking in polynomial time",
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.",
author = "Sebastian Maneth and Thomas Perst and Helmut Seidl",
year = "2006",
doi = "10.1007/11965893_18",
language = "English",
isbn = "354069269X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "254--268",
booktitle = "Database Theory, ICDT 2007 - 11th International Conference, Proceedings",
note = "11th International Conference on Database Theory, ICDT 2007 ; Conference date: 10-01-2007 Through 12-01-2007",
}