License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2010.469
URN: urn:nbn:de:0030-drops-28877
URL: http://drops.dagstuhl.de/opus/volltexte/2010/2887/
Go to the corresponding LIPIcs Volume Portal


Genest, Blaise ; Muscholl, Anca ; Wu, Zhilin

Verifying Recursive Active Documents with Positive Data Tree Rewriting

pdf-format:
Document 1.pdf (515 KB)


Abstract

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.

BibTeX - Entry

@InProceedings{genest_et_al:LIPIcs:2010:2887,
  author =	{Blaise Genest and Anca Muscholl and Zhilin Wu},
  title =	{{Verifying Recursive Active Documents with Positive Data Tree Rewriting}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
  pages =	{469--480},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-23-1},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{8},
  editor =	{Kamal Lodaya and Meena Mahajan},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2887},
  URN =		{urn:nbn:de:0030-drops-28877},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2010.469},
  annote =	{Keywords: Active documents, Guarded Active XML,  verification, data trees, tree rewriting, well-structured systems.}
}

Keywords: Active documents, Guarded Active XML, verification, data trees, tree rewriting, well-structured systems.
Seminar: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)
Issue Date: 2010
Date of publication: 14.12.2010


DROPS-Home | Fulltext Search | Imprint Published by LZI