Bottom-up automata on data trees and vertical XPath

Diego Figueira 1 Luc Segoufin 2, 3
2 DAHU - Verification in databases
LSV - Laboratoire Spécification et Vérification [Cachan], ENS Cachan - École normale supérieure - Cachan, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8643
3 VALDA - Value from Data
Inria de Paris
Abstract : A data tree is a finite tree whose every node carries a label from a finite alphabet and a datum from some infinite domain. We introduce a new model of automata over unranked data trees with a decidable emptiness problem. It is essentially a bottom-up alternating automaton with one register that can store one data value and can be used to perform equality tests with the data values occurring within the subtree of the current node. We show that it captures the expressive power of the vertical fragment of XPath - containing the child, descendant, parent and ancestor axes - obtaining thus a decision procedure for its satisfiability problem.
Type de document :
Article dans une revue
Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2017, pp.1-40. 〈10.08748〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01631219
Contributeur : Luc Segoufin <>
Soumis le : mercredi 8 novembre 2017 - 20:58:00
Dernière modification le : jeudi 11 janvier 2018 - 06:22:14

Identifiants

Citation

Diego Figueira, Luc Segoufin. Bottom-up automata on data trees and vertical XPath. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2017, pp.1-40. 〈10.08748〉. 〈hal-01631219〉

Partager

Métriques

Consultations de la notice

45