Reverse Engineering Through Automata Learning

DOI10.1007/978-3-030-87348-6_11zbMATH Open1520.68077MaRDI QIDQ6488341

Doron A. Peled

Publication date: 13 April 2023

Mathematics Subject Classification ID

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

Cites Work

• Learning regular sets from queries and counterexamples
• Inference of finite automata using homing sequences
• Testing Software Design Modeled by Finite-State Machines
• Model checking of safety properties
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

Recommendations

• Reverse engineering 👍 👎
• Automata Learning with Automated Alphabet Abstraction Refinement 👍 👎
• Learning Symbolic Automata 👍 👎
• Automata Learning through Counterexample Guided Abstraction Refinement 👍 👎
• Protocol State Machine Reverse Engineering with a Teaching-Learning Approach 👍 👎
• Automata Learning 👍 👎

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