Automated reasoning on trees with cardinality constraints

Abstract : Arithmetical constraints are widely used in formal languages like regular expressions, tree grammars and paths. In XML they are used to impose bounds on the number of occurrences described by content models of schema languages (XML Schema, RelaxNG). In query languages (XPath, XQuery), they allow selecting nodes that have a bounded number of nodes reachable by a given path expression. Counting types and paths are thus natural extensions of their countless counterparts already regarded as the core constructs in XML languages and type systems. One of the biggest challenges in XML is to develop automated procedures for ensuring static-type safety and optimization techniques. To this end, there is a need to solve some basic reasoning tasks that involve constructions such as counting XML schemas and XPath expressions. Every compiler of XML programs will have to routinely solve problems such as type and path typechecking, for ensuring at compile time that invalid documents can never arise as the output of XML processing code. This thesis studies efficient reasoning frameworks able to express counting constraints on tree structures. It was recently shown that the μ-calculus, when extended with counting constraints on immediate successor nodes is undecidable over graphs. Here we show that, when interpreted over finite trees, the logic with counting constraints is decidable in single exponential time. Furthermore, this logic allows more general counting operators. For example, the logic can pose numerical constraints on number of ancestors or descendants. We also present linear translations of counting XPath expressions and XML schemas into the logic.
Document type :
Theses
Computer Science. Université de Grenoble, 2011. English


https://tel.archives-ouvertes.fr/tel-00569058
Contributor : Everardo Barcenas <>
Submitted on : Wednesday, March 23, 2011 - 3:12:37 PM
Last modification on : Thursday, March 24, 2011 - 10:06:37 AM

Identifiers

  • HAL Id : tel-00569058, version 2

Collections

CNRS | INRIA | LIG | UGA

Citation

Everardo Barcenas. Automated reasoning on trees with cardinality constraints. Computer Science. Université de Grenoble, 2011. English. <tel-00569058v2>

Export

Share

Metrics

Consultation de
la notice

232

Téléchargement du document

61