One-variable context-free hedge automata

作者：

Highlights：

• We define a new hedge automata model where all transitions are rewrite rules.

• This model captures significant rewrite systems with computable closures.

• Rewrite closures results are applied to the analysis of XML access control policies.

摘要

•We define a new hedge automata model where all transitions are rewrite rules.•This model captures significant rewrite systems with computable closures.•Rewrite closures results are applied to the analysis of XML access control policies.

论文关键词：Hedge automata,Rewrite closure,Verification,Static type checking,XQuery Update,Access control

论文评审过程：Received 23 June 2015, Revised 15 September 2016, Accepted 21 October 2016, Available online 3 November 2016, Version of Record 6 June 2019.

论文官网地址：https://doi.org/10.1016/j.jcss.2016.10.006