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
    [Show abstract] [Hide abstract]
    ABSTRACT: Arden's Lemma is a classical result in language theory allowing the computation of a rational expression denoting the language recognized by a finite string automaton. In this paper we generalize this important lemma to the rational tree languages. Moreover, we propose also a construction of a rational tree expression which denotes the accepted tree language of a finite tree automaton.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Nested words model data with both linear and hierarchical structure such as XML documents and program traces. A nested word is a sequence of positions together with a matching relation that connects open tags (calls) with the corresponding close tags (returns). Visibly Pushdown Automata are a restricted class of pushdown automata that process nested words, and have many appealing theoretical properties such as closure under Boolean operations and decidable equivalence. However, like any classical automata models, they are limited to finite alphabets. This limitation is restrictive for practical applications to both XML processing and program trace analysis, where values for individual symbols are usually drawn from an unbounded domain. With this motivation , we introduce Symbolic Visibly Pushdown Automata (SVPA) as an executable model for nested words over infinite alphabets. In this model, transitions are labeled with first-order predicates over the input alphabet, analogous to symbolic automata processing strings over infinite alphabets. A key novelty of SVPAs is the use of binary predicates to model relations between open and close tags in a nested word. We show how SVPAs still enjoy the decidability and closure properties of Visibly Pushdown Automata. We use SVPAs to model XML validation policies and program properties that are not naturally expressible with previous formalisms and provide experimental results for our implementation.
    CAV14; 07/2014
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Satisfiability problem for modal logic K with quantifier-free Presburger and regularity constraints (EML) is known to be pspace-complete. In this paper, we consider its extension with nonregular constraints, and more specifically those expressed by visibly pushdown languages (VPL). This class of languages behaves nicely, in particular when combined with Propositional Dynamic Logic (PDL). By extending EML, we show that decidability is preserved if we allow at most one positive VPL-constraint at each modal depth. However, the presence of two VPL-contraints or the presence of a negative occurrence of a single VPL-constraint leads to undecidability. These results contrast with the decidability of PDL augmented with VPL-constraints.

Full-text (3 Sources)

Available from
May 23, 2014