Please use this identifier to cite or link to this item:
Title: On deciding well-definedness for query languages on trees
Authors: VANSUMMEREN, Stijn 
Issue Date: 2007
Source: JOURNAL OF THE ACM, 54(4)
Abstract: The 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.
Notes: Hasselt 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,
Keywords: verification; theory; languages; runtime errors; well-definedness; XQuery
Document URI:
Link to publication:
ISSN: 0004-5411
e-ISSN: 1557-735X
ISI #: 000248764700004
Category: A1
Type: Journal Contribution
Validations: ecoom 2008
Appears in Collections:Research publications

Show full item record


checked on May 22, 2022

Page view(s)

checked on May 25, 2022

Google ScholarTM


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