Reverse Engineering Through Automata Learning

DOI10.1007/978-3-030-87348-6_11MaRDI QIDQ6488341zbMATH OpenFDO

Authors Doron Peled

Publication date 13 April 2023

Full work available at URL https://doi.org/10.1007/978-3-030-87348-6_11

Mathematics Subject Classification ID

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

Recommendations

• Automata Learning through Counterexample Guided Abstraction Refinement
• Reverse engineering
• Protocol state machine reverse engineering with a teaching-learning approach
• Learning symbolic automata
• Automata Learning
• Automata learning with automated alphabet abstraction refinement

Cites work

• scientific article; zbMATH DE number 2080060 (Why is no real title available?)
• scientific article; zbMATH DE number 1418458 (Why is no real title available?)
• scientific article; zbMATH DE number 3423954 (Why is no real title available?)
• Inference of finite automata using homing sequences
• Learning regular sets from queries and counterexamples
• Model checking
• Model checking of safety properties
• Testing Software Design Modeled by Finite-State Machines

Cited in

(1)

• Efficient active automata learning via mutation testing

This page was built for publication: Reverse Engineering Through Automata Learning

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