Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/8451
Title: Typechecking top-down XML transformations: Fixed input or output schemas
Authors: Martens, W
NEVEN, Frank 
GYSSENS, Marc 
Issue Date: 2008
Publisher: ACADEMIC PRESS INC ELSEVIER SCIENCE
Source: INFORMATION AND COMPUTATION, 206(7). p. 806-827
Abstract: Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. In this general setting, both the input and output schema as well as the transformation are part of the input for the problem. However, scenarios where the input or output schema can be considered to be fixed, are quite common in practice. In the present work, we investigate the computational complexity of the typechecking problem in the latter setting. (c) 2008 Elsevier Inc. All rights reserved.
Notes: Tech Univ Dortmund, Lehrstuhl Informat 1, D-44221 Dortmund, Germany. Transnatl Univ Limburg, B-3590 Diepenbeek, Belgium. Hasselt Unit, B-3590 Diepenbeek, Belgium.
Keywords: XML; XSLT; tree transformations; typechecking; unranked tree transducers; complexity
Document URI: http://hdl.handle.net/1942/8451
ISSN: 0890-5401
e-ISSN: 1090-2651
DOI: 10.1016/j.ic.2008.01.002
ISI #: 000258015900002
Category: A1
Type: Journal Contribution
Validations: ecoom 2009
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
Typechecking.pdfPreprint359.12 kBAdobe PDFView/Open
Show full item record

SCOPUSTM   
Citations

13
checked on Sep 2, 2020

WEB OF SCIENCETM
Citations

10
checked on May 22, 2022

Page view(s)

50
checked on May 21, 2022

Download(s)

98
checked on May 21, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.