Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/8451
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMARTENS, Wim-
dc.contributor.authorNEVEN, Frank-
dc.contributor.authorGYSSENS, Marc-
dc.date.accessioned2008-09-08T08:13:56Z-
dc.date.available2008-09-08T08:13:56Z-
dc.date.issued2008-
dc.identifier.citationINFORMATION AND COMPUTATION, 206(7). p. 806-827-
dc.identifier.issn0890-5401-
dc.identifier.urihttp://hdl.handle.net/1942/8451-
dc.description.abstractTypechecking 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.-
dc.language.isoen-
dc.publisherACADEMIC PRESS INC ELSEVIER SCIENCE-
dc.subject.otherXML; XSLT; tree transformations; typechecking; unranked tree transducers; complexity-
dc.titleTypechecking top-down XML transformations: Fixed input or output schemas-
dc.typeJournal Contribution-
dc.identifier.epage827-
dc.identifier.issue7-
dc.identifier.spage806-
dc.identifier.volume206-
local.format.pages22-
local.bibliographicCitation.jcatA1-
dc.description.notesTech Univ Dortmund, Lehrstuhl Informat 1, D-44221 Dortmund, Germany. Transnatl Univ Limburg, B-3590 Diepenbeek, Belgium. Hasselt Unit, B-3590 Diepenbeek, Belgium.-
local.type.refereedRefereed-
local.type.specifiedArticle-
dc.bibliographicCitation.oldjcatA1-
dc.identifier.doi10.1016/j.ic.2008.01.002-
dc.identifier.isi000258015900002-
item.fulltextWith Fulltext-
item.contributorMARTENS, Wim-
item.contributorNEVEN, Frank-
item.contributorGYSSENS, Marc-
item.fullcitationMARTENS, Wim; NEVEN, Frank & GYSSENS, Marc (2008) Typechecking top-down XML transformations: Fixed input or output schemas. In: INFORMATION AND COMPUTATION, 206(7). p. 806-827.-
item.accessRightsClosed Access-
item.validationecoom 2009-
crisitem.journal.issn0890-5401-
crisitem.journal.eissn1090-2651-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
Typechecking.pdfNon Peer-reviewed author version359.12 kBAdobe PDFView/Open
Show simple item record

Google ScholarTM

Check

Altmetric


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