Approximation-based tree regular model-checking

MaRDI QIDQ3181700zbMATH OpenFDO

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

Publication date 12 October 2009

zbMATH Keywords

regular languagessecurity protocolsverification

Mathematics Subject Classification ID

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

Recommendations

• Handling left-quadratic rules when completing tree automata
• HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA
• Tree regular model checking: a simulation-based approach
• Abstract regular tree model checking
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(6)

• Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
• TAGED Approximations for Temporal Properties Model-Checking
• HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA
• Handling left-quadratic rules when completing tree automata
• SAT-based automated completion for reachability analysis
• A theoretical limit for safety verification techniques with regular fix-point computations

Describes a project that uses

Uses Software

• HERMES
• Timbuk

This page was built for publication: Approximation-based tree regular model-checking

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