Verifying Recursive Active Documents with Positive Data Tree Rewriting

Blaise Genest (1) , Anca Muscholl (2) , Zhilin Wu (2)

1 DISTRIBCOM - Distributed and Iterative Algorithms for the Management of Telecommunications Systems
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique

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.

Domaines: Base de données [cs.DB]; Autre [cs.OH]

Blaise Genest, Anca Muscholl, Zhilin Wu. Verifying Recursive Active Documents with Positive Data Tree Rewriting. Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), 2010, India. pp.469-480. ⟨hal-00461272⟩