XML schema, tree logic and sheaves automata

Abstract : XML documents may be roughly described as unranked, ordered trees and it is therefore natural to use tree automata to process or validate them. This idea has already been successfully applied in the context of Document Type Definition (DTD), the simplest standard for defining document validity, but additional work is needed to take into account XML Schema, a more advanced standard, for which regular tree automata are not satisfactory. In this paper, we introduce Sheaves Logic (SL), a new tree logic that extends the syntax of the – recursion-free fragment of – W3C XML Schema Definition Language (WXS). Then, we define a new class of automata for unranked trees that provides decision procedures for the basic questions about SL: model-checking; satisfiability; entailment. The same class of automata is also used to answer basic questions about WXS, including recursive schemas: decidability of type-checking documents; testing the emptiness of schemas; testing that a schema subsumes another one.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00109288
Contributor : Silvano Dal Zilio <>
Submitted on : Monday, March 6, 2017 - 10:52:59 AM
Last modification on : Thursday, April 4, 2019 - 4:48:05 PM
Long-term archiving on : Wednesday, June 7, 2017 - 1:16:16 PM

File

xml.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Silvano Dal Zilio, Denis Lugiez. XML schema, tree logic and sheaves automata. Applicable Algebra in Engineering, Communication and Computing, Springer Verlag, 2006, 17, pp.337-377. ⟨10.1007/s00200-006-0016-7⟩. ⟨hal-00109288⟩

Share

Metrics

Record views

142

Files downloads

177