Cited By
View all- Genevès PLayaïda NSchmitt AGesbert N(2015)Efficiently Deciding μ-Calculus with Converse over Finite TreesACM Transactions on Computational Logic10.1145/272471216:2(1-41)Online publication date: 2-Apr-2015
On the analysis of queries with counting constraints
Pages 21 - 24
Abstract
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select portions of documents subject to transformations. We explore how recent results on the static analysis of navigational aspects of XPath can be extended to counting constraints. The static analysis of this combined XPath fragment allows to detect bugs in transformations and to perform many kinds of optimizations of document transformations. More precisely, we study how a logic for finite trees capable of expressing upward and downward recursive navigation, can be equipped with a counting operator along regular path expressions.
References
[1]
E. Barcenas, P. Genevès, and N. Layaida. Counting in trees along multidirectional regular paths. In PLAN-X'09, January 2009.
[2]
M. Benedikt, W. Fan, and F. Geerts. XPath satisfiability in the presence of DTDs. J. ACM 55(2):1--79, 2008.
[3]
J. Clark and S. DeRose. XML path language (XPath) version 1.0. W3C recommendation, November 1999. http://www.w3.org/TR/1999/REC-xpath-19991116.
[4]
S. Dal-Zilio, D. Lugiez, and C. Meyssonnier. A logic you can count on. SIGPLAN Not., 39(1):135--146, 2004.
[5]
P. Genevès, N. Layaïda, and A. Schmitt. Efficient static analysis of XML paths and types. In PLDI '07, pages 342--351, New York, NY, USA, 2007. ACM Press.
[6]
F. Kladtke and H. Ruess. Parikh automata and modanic second-order logics with linear cardinality constraints. In Technical Report 177. Institute of CS at Freiburg University, 2002.
[7]
M. Murata, D. Lee, M. Mani, and K. Kawaguchi. Taxonomy of XML schema languages using formal language theory. ACM Trans. Internet Techn., 5(4):660--704, 2005.
[8]
F. Neven and T. Schwentick. Xpath containment in the presence of disjunction, dtds, and variables. In D. Calvanese, M. Lenzerini, and R. Motwani, editors, ICDT, volume 2572 of LNCS, pages 312--326. Springer, 2003.
[9]
H. Seidl, T. Schwentick, A. Muscholl, and P. Habermehl. Counting in trees for free. In J. Diaz J. Karhumäki, A. Lepistö, and D. Sannella, editors, ICALP, volume 3142 of LNCS, pages 1136--1149. Springer, 2004.
[10]
Y. Tanabe, K. Takahashi, M. Yamamoto, A. Tozawa, and M. Hagiya. A decision procedure for the alternation-free two-way modal mu-calculus. In B. Beckert, editor, TABLEAUX, volume 3702 of LNCS, pages 277--291. Springer, 2005.
Index Terms
- On the analysis of queries with counting constraints
Recommendations
Reformulating XPath queries and XSLT queries on XSLT views
Applications using XML for data representation very often use different XML formats and thus require the transformation of XML data. The common approach transforms entire XML documents from one format into another, e.g. by using an XSLT stylesheet. ...
SPath: a path language for XML schema
WWW '07: Proceedings of the 16th international conference on World Wide WebXML is increasingly being used as a typed data format, and therefore it becomes more important to gain access to the type system; very often this is an XML Schema. The XML Schema Path Language (SPath) presented in this paper provides access to XML ...
The essence of XML
The World-Wide Web Consortium (W3C) promotes XML and related standards, including XML Schema, XQuery, and XPath. This paper describes a formalization of XML Schema. A formal semantics based on these ideas is part of the official XQuery and XPath ...
Comments
Information & Contributors
Information
Published In
September 2009
264 pages
ISBN:9781605585758
DOI:10.1145/1600193
- General Chair:
- Uwe M. Borghoff,
- Program Chair:
- Boris Chidlovskii
Copyright © 2009 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 16 September 2009
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Overall Acceptance Rate 194 of 564 submissions, 34%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 94Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Jan 2025
Other Metrics
Citations
Cited By
View all- Genevès PLayaïda NSchmitt AGesbert N(2015)Efficiently Deciding μ-Calculus with Converse over Finite TreesACM Transactions on Computational Logic10.1145/272471216:2(1-41)Online publication date: 2-Apr-2015
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in