Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/4135
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVANSUMMEREN, Stijn-
dc.date.accessioned2007-12-11T08:40:19Z-
dc.date.available2007-12-11T08:40:19Z-
dc.date.issued2007-
dc.identifier.citationJOURNAL OF THE ACM, 54(4)-
dc.identifier.issn0004-5411-
dc.identifier.urihttp://hdl.handle.net/1942/4135-
dc.description.abstractThe well-definedness problem for a database query language consists of checking, given an expression and an input type, that the expression never yields a runtime error on any input adhering to the input type. In this article, we study the well-definedness problem for query languages on trees that are built from a finite set of partially defined base operations by adding variables, constants, conditionals, let bindings, and iteration. We identify properties of base operations that can make the problem undecidable and give restrictions that are sufficient to ensure decidability. As a direct result, we obtain a large fragment of XQuery for which well-definedness is decidable.-
dc.language.isoen-
dc.publisherASSOC COMPUTING MACHINERY-
dc.subject.otherverification; theory; languages; runtime errors; well-definedness; XQuery-
dc.titleOn deciding well-definedness for query languages on trees-
dc.typeJournal Contribution-
dc.identifier.issue4-
dc.identifier.volume54-
local.format.pages37-
local.bibliographicCitation.jcatA1-
dc.description.notesHasselt Univ, Theoret Comp Sci Grp, B-3590 Diepenbeek, Belgium. Transnatl Univ Limburg, Limburg, Belgium.VANSUMMEREN, S, Hasselt Univ, Theoret Comp Sci Grp, Agoralaan Gebouw D, B-3590 Diepenbeek, Belgium.stijn.vansummeren@uhasselt.be-
local.type.refereedRefereed-
local.type.specifiedArticle-
dc.bibliographicCitation.oldjcatA1-
dc.identifier.isi000248764700004-
dc.identifier.urlhttp://doi.acm.org/10.1145/1255443.1255447-
item.accessRightsClosed Access-
item.validationecoom 2008-
item.fullcitationVANSUMMEREN, Stijn (2007) On deciding well-definedness for query languages on trees. In: JOURNAL OF THE ACM, 54(4).-
item.fulltextNo Fulltext-
crisitem.journal.issn0004-5411-
crisitem.journal.eissn1557-735X-
Appears in Collections:Research publications
Show simple item record

WEB OF SCIENCETM
Citations

2
checked on Jun 23, 2022

Page view(s)

50
checked on Jun 28, 2022

Google ScholarTM

Check


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