Verifying recursive active documents with positive data tree rewriting

DOI10.4230/LIPICS.FSTTCS.2010.469MaRDI QIDQ2908878zbMATH OpenFDO

Authors Blaise Genest, Anca Muscholl, Zhilin Wu

Publication date 29 August 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_9289.html

zbMATH Keywords

verificationdata treeswell-structured systemsactive documentsguarded active XMLtree rewriting

Mathematics Subject Classification ID

Database theory (68P15) Grammars and rewriting systems (68Q42)

Recommendations

• Tree Pattern Rewriting Systems
• Active XML document rewriting based on tree automata theory
• Games for active XML revisited
• Games for active XML revisited
• Complexity of Data Tree Patterns over XML Documents

Cited in

(3)

• Petri nets with structured data
• Tree Pattern Rewriting Systems
• Games for active XML revisited

This page was built for publication: Verifying recursive active documents with positive data tree rewriting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908878)