One-variable context-free hedge automata

被引：1
|
作者：
Jacquemard, Florent [1 ]
Rusinowitch, Michael [2 ]
机构：
[1] INRIA Paris Rocquencourt, Ircam UMR, 1 Pl Igor Stravinsky, F-75004 Paris, France
[2] INRIA Nancy Grand Est, LORIA UMR, 615 Rue Jardin Bot, F-54602 Villers Les Nancy, France
来源：
JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 2019年 / 104卷
关键词：
Hedge automata; Rewrite closure; Verification; Static type checking; XQuery Update; Access control; TREE PUSHDOWN-AUTOMATA; XML; LANGUAGES;
D O I：
10.1016/j.jcss.2016.10.006
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
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. (C) 2016 Elsevier Inc. All rights reserved.
引用
收藏
页码：278 / 296
页数：19
相关论文
共 50 条
12345