One-variable context-free hedge automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Computer and System Sciences Year : 2016

One-variable context-free hedge automata


We introduce an extension of hedge automata called One-Variable Context-Free Hedge Automata. The class of unranked ordered tree languages they recognize has polynomial membership problem and is preserved by rewrite closure with inverse-monadic rules. We also propose a modeling of primitives of the W3C XQuery Update Facility by mean of parameterized rewriting rules, and show that the rewrite closure of a context-free hedge language with these extended rewriting systems is a context-free hedge language. This result is applied to static analysis of XML access control policies expressed with update primitives.
Fichier principal
Vignette du fichier
CFHA-long.pdf (386.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01426626 , version 1 (04-01-2017)



Florent Jacquemard, Michael Rusinowitch. One-variable context-free hedge automata. Journal of Computer and System Sciences, 2016, ⟨10.1016/j.jcss.2016.10.006⟩. ⟨hal-01426626⟩
354 View
161 Download



Gmail Facebook X LinkedIn More