Conference Paper

XML Schema, Tree Logic and Sheaves Automata.

DOI: 10.1007/3-540-44881-0_18 Conference: Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings
Source: DBLP

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 Defi- nition (DTD), the simplest standard for defining document va lidity, but additional work is needed to take into account XML Schema, a more advanced standard, for which regular tree automata are not satisfactory. In thi s 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 provide s decision proce- dures for the basic questions about SL: model-checking; satisfiability; entailment. The same class of automata is also used to answer basic questions about WXS, in- cluding recursive schemas: decidability of type-checking documents; testing the emptiness of schemas; testing that a schema subsumes another one.

  • Source
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We consider the framework of regular hedge model checking where configurations are represented by trees of arbitrary arities, sets of configurations are represented by regular hedge automata, and the dynamic of a system is modeled by a term rewriting system. We consider the problem of computing the transitive closure R ∗(L) of a hedge automaton L and a (not necessarily structure preserving) term rewriting system R. This construction is not possible in general. Therefore, we present a semi-algorithm that computes, in case of termination, an over-approximation of this reachability set. We show that our procedure computes the exact reachability set in many practical applications. We have successfully applied our technique to compute transitive closures for some mutual exclusion protocols defined on arbitrary width tree topologies, as well as for two interesting XML applications.
    IJCCBS. 01/2012; 3:132-150.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We present algorithms for testing language inclusion L(A) ⊆ L(B) between tree automata in time O(|A| · |B|) where B is deterministic (bottom-up or top-down). We extend our algorithms for testing inclusion of automata for unranked trees A in deterministic DTDs or deterministic EDTDs with re- strained competition D in time O(|A| · |Σ| · |D|). Previous algorithms were less efficient or less general.

Full-text (3 Sources)

Available from
May 23, 2014