www.uhasselt.be
DSpace

Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/4132

Title: Frontiers of tractability for typechecking simple XML transformations
Authors: MARTENS, Wim
NEVEN, Frank
Issue Date: 2007
Publisher: ACADEMIC PRESS INC ELSEVIER SCIENCE
Citation: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 73(3). p. 362-390
Abstract: Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus on complete algorithms which always produce the correct answer, We consider top-down XML transformations incorporating XPath expressions and abstract document types by grammars and tree automata. By restricting schema languages and transformations, we identify several practical settings for which typechecking call be done in polynomial time. Moreover, the resulting framework provides a rather complete picture as we show that most scenarios cannot be enlarged without rendering the typechecking problem intractable. So. the present research sheds light oil when to use fast complete algorithms and when to reside to sound but incomplete ones. (c) 2006 Elsevier Inc. All rights reserved.
Notes: Hassels Univ, B-3590 Diepenbeek, Belgium. Transnatl Univ Limburg, B-3590 Diepenbeek, Belgium.MARTENS, W, Hassels Univ, Agoralaan,Bldg D, B-3590 Diepenbeek, Belgium.wim.martens@uhasselt.be frank.neven@uhasselt.be
URI: http://hdl.handle.net/1942/4132
DOI: 10.1016/j.jcss.2006.10.005
ISI #: 000245835100006
ISSN: 0022-0000
Category: A1
Type: Journal Contribution
Validation: ecoom, 2008
Appears in Collections: Research publications

Files in This Item:

There are no files associated with this item.

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