Verifying Recursive Active Documents with Positive Data Tree Rewriting

This paper considers a tree-rewriting framework for modeling documents evolving through service calls. We focus on the automatic verification of properties of documents that may contain data from an infinite domain. We establish the boundaries of decidability: while verifying documents with recursive calls is undecidable, we obtain decidability as soon as either documents are in the positive-bounded fragment (while calls are unrestricted), or when there is a bound on the number of service calls (bounded model-checking of unrestricted documents). In the latter case, the complexity is NexpTime-complete. Our data tree-rewriting framework resembles Guarded Active XML, a platform handling XML repositories that evolve through web services. The model here captures the basic features of Guarded Active XML and extends it by node renaming and subtree deletion. Digital Object Identifier 10.4230/LIPIcs.xxx.yyy.p

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Blaise Genest, Anca Muscholl, Zhilin Wu
• Keywords: CORR 2010, Documents, Education, Service Calls, Tree-rewriting Framework