Handling left-quadratic rules when completing tree automata

DOI10.1016/J.ENTCS.2008.12.031MaRDI QIDQ4982086zbMATH OpenOpenAlexFDO

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

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

left-linearityrewriting techniquessecuritytree automata

Mathematics Subject Classification ID

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

Recommendations

• HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA
• Approximation-based tree regular model-checking
• Completeness of tree automata completion
• Reachability Analysis with State-Compatible Automata
• Reachability problems on regular ground tree rewriting graphs

Cites work

• Abstract regular tree model checking
• Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
• Bottom-up tree pushdown automata and rewrite systems
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• Decidable approximations of term rewriting 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
• scientific article; zbMATH DE number 1614701 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1956589 (Why is no real title available?)
• scientific article; zbMATH DE number 1903379 (Why is no real title available?)
• scientific article; zbMATH DE number 1903380 (Why is no real title available?)
• scientific article; zbMATH DE number 794243 (Why is no real title available?)
• Reachability analysis over term rewriting systems
• Regular sets of descendants by leftmost strategy
• Rewriting Approximations for Fast Prototyping of Static Analyzers

Cited in

(4)

• Reachability analysis of innermost rewriting
• Approximation-based tree regular model-checking
• HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA
• Tree automata for detecting attacks on protocols with algebraic cryptographic primitives

Describes a project that uses

Uses Software

• Timbuk

This page was built for publication: Handling left-quadratic rules when completing tree automata

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