Exact XML Type Checking in Polynomial Time

Sebastian Maneth, Thomas Perst, Helmut Seidl

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.
Original languageEnglish
Title of host publicationDatabase Theory - ICDT 2007
Subtitle of host publication11th International Conference, Barcelona, Spain, January 10-12, 2007, Proceedings
PublisherSpringer Berlin Heidelberg
Pages254-268
Number of pages15
Volume4353
ISBN (Electronic)978-3-540-69270-6
ISBN (Print)978-3-540-69269-0
DOIs
Publication statusPublished - 2007

Fingerprint Dive into the research topics of 'Exact XML Type Checking in Polynomial Time'. Together they form a unique fingerprint.

Cite this