Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/4132
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | MARTENS, Wim | - |
dc.contributor.author | NEVEN, Frank | - |
dc.date.accessioned | 2007-12-11T08:37:10Z | - |
dc.date.available | 2007-12-11T08:37:10Z | - |
dc.date.issued | 2007 | - |
dc.identifier.citation | JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 73(3). p. 362-390 | - |
dc.identifier.issn | 0022-0000 | - |
dc.identifier.uri | http://hdl.handle.net/1942/4132 | - |
dc.description.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. | - |
dc.language.iso | en | - |
dc.publisher | ACADEMIC PRESS INC ELSEVIER SCIENCE | - |
dc.subject.other | XML; XSLT; tree transforrnations; typcchecking; unranked tree transducers; complexity | - |
dc.title | Frontiers of tractability for typechecking simple XML transformations | - |
dc.type | Journal Contribution | - |
dc.identifier.epage | 390 | - |
dc.identifier.issue | 3 | - |
dc.identifier.spage | 362 | - |
dc.identifier.volume | 73 | - |
local.format.pages | 29 | - |
local.bibliographicCitation.jcat | A1 | - |
dc.description.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 | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
dc.bibliographicCitation.oldjcat | A1 | - |
dc.identifier.doi | 10.1016/j.jcss.2006.10.005 | - |
dc.identifier.isi | 000245835100006 | - |
item.accessRights | Closed Access | - |
item.fullcitation | MARTENS, Wim & NEVEN, Frank (2007) Frontiers of tractability for typechecking simple XML transformations. In: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 73(3). p. 362-390. | - |
item.contributor | MARTENS, Wim | - |
item.contributor | NEVEN, Frank | - |
item.fulltext | No Fulltext | - |
item.validation | ecoom 2008 | - |
crisitem.journal.issn | 0022-0000 | - |
crisitem.journal.eissn | 1090-2724 | - |
Appears in Collections: | Research publications |
SCOPUSTM
Citations
15
checked on Sep 2, 2020
WEB OF SCIENCETM
Citations
12
checked on Apr 22, 2024
Page view(s)
92
checked on May 30, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.