Rewrite based Verification of XML Updates

Details Rewrite based Verification of XML Updates Rewrite based Verification of XML Updates

2009-07-29

arxiv.org/abs/0907.5125v1

Computer Science

Logic in Computer Science

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Rewrite based Verification of XML Updates does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Rewrite based Verification of XML Updates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rewrite based Verification of XML Updates will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-521660