Tree Pattern Rewriting Systems

DOI10.1007/978-3-540-88387-6_29zbMath1183.68372OpenAlexW1560764077MaRDI QIDQ3540083

Anca Muscholl, Olivier Serre, Blaise Genest, 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

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

Related Items (2)

Tree Pattern Rewriting Systems ⋮ Equational approximations for tree automata completion

Cites Work

• Unnamed Item
• Unnamed Item
• Verifying lossy channel systems has nonprimitive recursive complexity.
• Transition Graphs of Rewriting Systems over Unranked Trees
• Tree Pattern Rewriting Systems
• Active XML Schemas
• Logics for Unranked Trees: An Overview
• Well-structured transition systems everywhere!

This page was built for publication: Tree Pattern Rewriting Systems