Tree Pattern Rewriting Systems

Classical verification often uses abstraction when dealing with data. On the other hand, dynamic XML-based applications have become pervasive, for instance with the ever growing importance of web services. We define here Tree Pattern Rewriting Systems (TPRS) as an abstract model of dynamic XML-based documents. TPRS systems generate infinite transition systems, where states are unranked and unordered trees (hence possibly modeling XML documents). Their guarded transition rules are described by means of tree patterns. Our main result is that given a TPRS system (T, R), a tree pattern P and some integer k such that any reachable document from T has depth at most k, it is decidable (albeit of non elementary complexity) whether some tree matching P is reachable from T.

• Type: Conference
• Year: 2008
• Where: ATVA
• Authors: Blaise Genest, Anca Muscholl, Olivier Serre, Marc Zeitoun
• Keywords: ATVA 2008, Dynamic Xml-based Applications, Dynamic Xml-based Documents, Hardware, Tree Pattern