XML with data values: typechecking revisited
Reads0
Chats0
TLDR
The main contribution of the present paper is to trace a fairly tight boundary of decidability for typechecking with data values for XML queries.About:
This article is published in Journal of Computer and System Sciences.The article was published on 2003-06-01 and is currently open access. It has received 91 citations till now. The article focuses on the topics: XML validation & Decidability.read more
Citations
More filters
Proceedings ArticleDOI
E-services: a look behind the curtain
TL;DR: This paper examines proposals and standards for e-services from the perspectives of XML, data management, workflow, and process models, including behavioral service signatures, verification and synthesis techniques for composite services, analysis of service data manipulation commands, and XML analysis applied to service specifications.
Book ChapterDOI
Automata and logics for words and trees over an infinite alphabet
TL;DR: This paper survey several know results on automata and logics manipulating data words and data trees, the focus being on their relative expressive power and decidability.
Book ChapterDOI
Automata, Logic, and XML
TL;DR: This work surveys some recent developments in the broad area of automata and logic which are motivated by the advent of XML, and considers unranked tree automata, tree-walking Automata, and automata over infinite alphabets.
Journal ArticleDOI
Automata for XML---A survey
TL;DR: An overview of fundamental properties of the different kinds of automata used in XML processing are given to relate them to the four key aspects of XML processing: schemas, navigation, querying and transformation.
Proceedings ArticleDOI
Two-variable logic on data trees and XML reasoning
TL;DR: It is shown that satisfiability for two-variable first-order logic is decidable if the tree structure can be accessed only through the child and the next sibling predicates and the access to data values is restricted to equality tests.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Book
The Definition of Standard ML
TL;DR: This book provides a formal definition of Standard ML for the benefit of all concerned with the language, including users and implementers, and the authors have defined their semantic objects in mathematical notation that is completely independent of StandardML.