Handling Left-Quadratic Rules When Completing Tree Automata

DOI10.1016/j.entcs.2008.12.031zbMath1337.68165OpenAlexW2043459883MaRDI QIDQ4982086

Roméo Courbis, Yohan Boichut, Olga Kouchnarenko, Pierre-Cyrille Héam

Publication date: 23 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.12.031

zbMATH Keywords

securitytree automataleft-linearityrewriting techniques

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives

Uses Software

• Timbuk

Cites Work

• Reachability analysis over term rewriting systems
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• Deterministic tree pushdown automata and monadic tree rewriting systems
• Finer Is Better: Abstraction Refinement for Rewriting Approximations
• Handling Algebraic Properties in Automatic Analysis of Security Protocols
• Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
• Bottom-up tree pushdown automata and rewrite systems
• Decidable approximations of term rewriting systems
• Rewriting Approximations for Fast Prototyping of Static Analyzers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Handling Left-Quadratic Rules When Completing Tree Automata