We study the typechecking problem for XML transformers: given an XML transformation program and a DTD for the input XML documents, check whether every ...

We have developed a general, robust framework for typechecking XML transformers. The k-pebble transducer provides an abstraction that can express existing XML ...

We study the typechecking problem for XML (eXtensible Markup Language) transformers: given an. XML transformation program and a DTD for the input XML ...

We study the typechecking problem for XML transform- ers: given an XML transformation program and a DTD for the input XML documents, check whether every ...

We study the typechecking problem for XML (eXtensible Markup Language) transformers: given an. XML transformation program and a DTD for the input XML ...

The main result of the paper is that typechecking for k-pebble transducers is decidable. Consequently, typechecking can be performed for a broad range of XML ...

We study the typechecking problem for XML (eXtensible Markup Language) transformers: given an XML transformation program and a DTD for the input XML documents.

Abstract. The typechecking problem for XML to XML transformations has recently attracted quite some attention in the literature. Given an input schema, ...

Abstract. AbstractWe study the typechecking problem for XML (eXtensible Markup Language) transformers: given an XML transformation program and a DTD for the ...

TL;DR: In this article, the authors exploit type information in static checking of programs for XML processing, in order to make the best use of the static ...