• Corpus ID: 16191377

# Complementing Model Learning with Mutation-Based Fuzzing

@article{Smetsers2016ComplementingML,
title={Complementing Model Learning with Mutation-Based Fuzzing},
author={Rick Smetsers and Joshua Moerman and Mark Janssen and Sicco Verwer},
journal={ArXiv},
year={2016},
volume={abs/1611.02429}
}
• Published 8 November 2016
• Computer Science
• ArXiv
An ongoing challenge for learning algorithms formulated in the Minimally Adequate Teacher framework is to efficiently obtain counterexamples. In this paper we compare and combine conformance testing and mutation-based fuzzing methods for obtaining counterexamples when learning finite state machine models for the reactive software systems of the Rigorous Exampination of Reactive Systems (RERS) challenge. We have found that for the LTL problems of the challenge the fuzzer provided an independent…

## Figures and Tables from this paper

Nominal Techniques and Black Box Testing for Automata Learning
Using an adaptation of state-of-the-art algorithms for black-box automata learning, as implemented in the LearnLib tool, we succeeded to learn a model of the Engine Status Manager (ESM), a software
Active Learning of Abstract System Models from Traces using Model Checking
• Computer Science
2022 Design, Automation & Test in Europe Conference & Exhibition (DATE)
• 2022
A new active model-learning approach to generating abstractions of a system implementation, as finite state automata (FSAs), from execution traces, using a pluggable model learning component that can generate an FSA from a given set of traces.
flexfringe: A Passive Automaton Learning Package
• Computer Science
2017 IEEE International Conference on Software Maintenance and Evolution (ICSME)
• 2017
Name, an open-source software tool to learn variants of finite state automata from traces using a state-of-the-art evidence-driven state-merging algorithm at its core is presented, embracing the need for customized models and tailored learning heuristics in different application domains by providing a flexible, extensible interface.
Combining Black-Box and White-Box Techniques for Learning Register Automata
• Computer Science
Computing and Software Science
• 2019
Some directions for future research on how black-box model learning can be enhanced using white-box information extraction methods are explored, with the aim to maintain the benefits of dynamic black- box methods while making effective use of information that can be obtained through white- box techniques.
Benchmarking Combinations of Learning and Testing Algorithms for Active Automata Learning
• Computer Science
TAP@STAF
• 2020
Active automata learning comprises techniques for learning automata models of black-box systems by testing such systems by using model-based analysis and verification techniques.
Improving Model Inference in Industry by Combining Active and Passive Learning
• Computer Science
2019 IEEE 26th International Conference on Software Analysis, Evolution and Reengineering (SANER)
• 2019
The learning time/completeness achieved trade-off of active learning is investigated with a pilot study at ASML, provider of lithography systems for the semiconductor industry, and the advocate extending active learning with execution logs and passive learning results is advocated.
Stochastic software testing for vulnerability analysis
• Computer Science
Scientific and Technical Journal of Information Technologies, Mechanics and Optics
• 2021
The promising positions model is introduced to improve the efficiency of input data generation and pays attention to the perspective position of a data element to increase code coverage and directs the genetic algorithm to change it.
Vulnerability Detection on Mobile Applications Using State Machine Inference
• Computer Science
2018 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW)
• 2018
This paper proposes a novel testing methodology that applies state machine learning of mobile Android applications in combination with algorithms that discover attack paths in the learned state machine that evidences the existence of a vulnerability in the mobile application.
Interpreting Finite Automata for Sequential Data
• Computer Science
NIPS 2016
• 2016
This paper identifies the key properties used to interpret automata and proposes a modification of a state-merging approach to learn variants of finite state automata that applies to problems beyond typical grammar inference tasks.
Active Model Learning for the Analysis of Network Protocols
In order to learn an over-approximation of a “large” Mealy machine M, a transducer is placed in between the teacher and the learner, which translates concrete inputs in I to abstract inputs in X, concrete outputs in O to abstract outputs in Y, and vice versa.

## References

SHOWING 1-10 OF 15 REFERENCES
The TTT Algorithm: A Redundancy-Free Approach to Active Automata Learning
• Computer Science
RV
• 2014
The distinguishing characteristic of TTT is its redundancy-free organization of observations, which can be exploited to achieve optimal (linear) space complexity, thanks to a thorough analysis of counterexamples, extracting and storing only the essential refining information.
Test Selection Based on Finite State Models
• Computer Science
IEEE Trans. Software Eng.
• 1991
A method for the selection of appropriate test case, an important issue for conformance testing of protocol implementations as well as software engineering, is presented and is shown to have general applicability, full fault-detection power, and yields shorter test suites than the W-method.
Diversity-based inference of finite automata
• Computer Science
28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
• 1987
A new procedure for inferring the structure of a finitestate automaton (FSA) from its input/output behavior, using access to the automaton to perform experiments, based on the notion of equivalence between testa.
Next Generation LearnLib
• Computer Science
TACAS
• 2011
The Next Generation LearnLib (NGLL) is a framework for model-based construction of dedicated learning solutions on the basis of extensible component libraries, which comprise various methods and
Minimal Separating Sequences for All Pairs of States
• Computer Science
LATA
• 2016
This paper presents an improved algorithm based on the minimization algorithm of Hopcroft that runs in $$\mathcal {O}(m \log n)$$ time and the efficiency of this algorithm is empirically verified and compared to the traditional algorithm.
Formal Methods for Protocol Engineering and Distributed Systems
• Computer Science
IFIP Advances in Information and Communication Technology
• 1999
This volume contains the proceedings of the Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols and Protocol Specification, Testing, and Verification, which was held in Beijing, China, in October 1999.
American Fuzzy Lop (AFL) fuzzer (2015), http://lcamtuf.coredump.cx/afl/, date
• 2015