The Design Space of Type Checkers for XML Transformation Languages
TLDR
This work characterize and evaluate existing tools in this design space, including a recent result of the authors providing practical type checking of full unannotated XSLT 1.0 stylesheets given general DTDs that describe the input and output languages.Abstract:
We survey work on statically type checking XML transformations, covering a wide range of notations and ambitions. The concept of type may vary from idealizations of DTD to full-blown XML Schema or even more expressive formalisms. The notion of transformation may vary from clean and simple transductions to domain-specific languages or integration of XML in general-purpose programming languages. Type annotations can be either explicit or implicit, and type checking ranges from exact decidability to pragmatic approximations.
We characterize and evaluate existing tools in this design space, including a recent result of the authors providing practical type checking of full unannotated XSLT 1.0 stylesheets given general DTDs that describe the input and output languages.read more
Citations
More filters
Proceedings ArticleDOI
XML type checking with macro tree transducers
TL;DR: It is proved that TL -- and thus in particular DTL - despite their expressiveness still allow for effective inverse type inference and is obtained by means of a translation of TL programs into compositions of top-down finite state tree transductions with parameters, also called (stay) macro tree transducers.
Journal Article
Exact XML type checking in polynomial time
TL;DR: In this article, an adaptive type checking algorithm based on forward type inference through exact characterizations of output languages is presented, which correctly type-checks all call-by-value stay macro tree transducers.
Proceedings ArticleDOI
Efficient static analysis of XML paths and types
TL;DR: An algorithm to solve XPath decision problems under regular tree type constraints and its use to statically type-check XPath queries is presented and the decidability of a logic with converse for finite ordered trees is proved.
Book ChapterDOI
The design space of type checkers for XML transformation languages
TL;DR: This work characterize and evaluate existing tools in this design space, including a recent result of the authors providing practical type checking of full unannotated XSLT 1.0 stylesheets given general DTDs that describe the input and output languages.
Proceedings ArticleDOI
XML transformation by tree-walking transducers with invisible pebbles
TL;DR: The pebble tree automaton and the peBble tree transducer are enhanced by additionally allowing an unbounded number of "invisible" pebbles, which lead to an XPath-like formalism that has a path expression for every MSO definable binary pattern.