2009/07/29 by Florent Jacquemard, Jacquemard, Florent, Michaël Rusinowitch +1
Computer Science · #Advanced Data Storage Technologies #Advanced Database Systems and Queries #Distributed systems and fault tolerance #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)
paper · pdf · doi:10.48550/arxiv.0907.5125
openalex publication_date 2009/07/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider problems of access control for update of XML documents. In the context of XML programming, types can be viewed as hedge automata, and static type checking amounts to verify that a program always converts valid source documents into also valid output documents. Given a set of update operations we are particularly interested by checking safety properties such as preservation of document types along any sequence of updates. We are also interested by the related policy consistency problem, that is detecting whether a sequence of authorized operations can simulate a forbidden one. We reduce these questions to type checking problems, solved by computing variants of hedge automata characterizing the set of ancestors and descendants of the initial document type for the closure of parameterized rewrite rules.