Tree Pattern Rewriting Systems

DOI10.1007/978-3-540-88387-6_29MaRDI QIDQ3540083zbMATH OpenOpenAlexFDO

Authors Blaise Genest, Anca Muscholl, Olivier Serre, Marc Zeitoun

Publication date 20 November 2008

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-88387-6_29

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Verifying recursive active documents with positive data tree rewriting
• Complexity of Data Tree Patterns over XML Documents
• Active XML document rewriting based on tree automata theory
• Controlled term rewriting
• Towards an Efficient Implementation of Tree Automata Completion

Cites work

• Active XML Schemas
• scientific article; zbMATH DE number 1223710 (Why is no real title available?)
• scientific article; zbMATH DE number 1948151 (Why is no real title available?)
• Logics for Unranked Trees: An Overview
• Transition Graphs of Rewriting Systems over Unranked Trees
• Tree Pattern Rewriting Systems
• Verifying lossy channel systems has nonprimitive recursive complexity.
• Well-structured transition systems everywhere!

Cited in

(3)

• Verifying recursive active documents with positive data tree rewriting
• Tree Pattern Rewriting Systems
• Equational approximations for tree automata completion

This page was built for publication: Tree Pattern Rewriting Systems

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