Efficient active automata learning via mutation testing

DOI10.1007/S10817-018-9486-0zbMath1468.68117OpenAlexW2898453745WikidataQ129032221 ScholiaQ129032221MaRDI QIDQ2331082

Bernhard K. Aichernig, Martin Tappler

Publication date: 25 October 2019

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-018-9486-0

zbMATH Keywords

conformance testingactive automata learningFSM-based testingmutation testingminimally adequate teacher framework

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Compositional learning for interleaving parallel automata ⋮ Learning deterministic one-clock timed automata via mutation testing ⋮ \(L^\ast\)-based learning of Markov decision processes (extended version) ⋮ Benchmarking Combinations of Learning and Testing Algorithms for Active Automata Learning

Uses Software

• LearnLib
• GitHub
• mut-learn
• MQTT

Cites Work

• Unnamed Item
• Learning register automata: from languages to program structures
• Active learning for extended finite state machines
• Learning regular sets from queries and counterexamples
• Inference of finite automata using homing sequences
• Automata Learning with Automated Alphabet Abstraction Refinement
• Testing Software Design Modeled by Finite-State Machines
• Fundamental Approaches to Software Engineering
• Testing finite-state machines: state identification and verification

This page was built for publication: Efficient active automata learning via mutation testing