Verifying Recursive Active Documents with Positive Data Tree Rewriting

Details Verifying Recursive Active Documents with Positive Data Tree Rewriting Verifying Recursive Active Documents with Positive Data Tree Rewriting

2010-03-04

arxiv.org/abs/1003.1010v1

Computer Science

Databases

Scientific paper

This paper proposes a data tree-rewriting framework for modeling evolving documents. The framework is close to Guarded Active XML, a platform used for handling XML repositories evolving through web services. We focus on automatic verification of properties of evolving documents that can contain data from an infinite domain. We establish the boundaries of decidability, and show that verification of a {\em positive} fragment that can handle recursive service calls is decidable. We also consider bounded model-checking in our data tree-rewriting framework and show that it is $\nexptime$-complete.

Affiliated with

Also associated with

No associations

Rating

Verifying Recursive Active Documents with Positive Data Tree Rewriting 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 Verifying Recursive Active Documents with Positive Data Tree Rewriting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Verifying Recursive Active Documents with Positive Data Tree Rewriting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-559980