Efficient Static Analysis of XML Paths and Types

Pierre Genevès 1, 2 Nabil Layaïda 2 Alan Schmitt 3
2 WAM - Web, adaptation and multimedia
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
3 SARDES - System architecture for reflective distributed computing environments
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : A new logic for reasoning over finite trees is proposed. This logic currently offers the best balance known between expressivity and complexity for decidability. It is as expressive as monadic second-order logic whereas its satisfiability is shown decidable in time complexity 2^O(n) w.r.t. size n of the formula. We present an effective algorithm in practice using symbolic techniques (BDDs), and use it for the static analysis of XPath queries in the presence of regular tree types, including XPath typing.
Type de document :
Communication dans un congrès
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation, Jun 2007, San Diego, United States. pp.342--351, 2007, 〈10.1145/1250734.1250773〉
Liste complète des métadonnées

Littérature citée [29 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00189123
Contributeur : Pierre Genevès <>
Soumis le : mardi 20 novembre 2007 - 17:34:46
Dernière modification le : mardi 3 octobre 2017 - 01:22:38
Document(s) archivé(s) le : lundi 12 avril 2010 - 02:47:08

Fichier

geneves-pldi07.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Pierre Genevès, Nabil Layaïda, Alan Schmitt. Efficient Static Analysis of XML Paths and Types. Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation, Jun 2007, San Diego, United States. pp.342--351, 2007, 〈10.1145/1250734.1250773〉. 〈hal-00189123〉

Partager

Métriques

Consultations de la notice

350

Téléchargements de fichiers

169