Improving FSM reverse engineering for test development in Erlang

Abstract

This thesis contributes with a new implementation of an algorithm that infers a finite state machine from samples of a grammar, and with an automated system able to apply this algorithm to aloud the visualization of EUnit test cases, without the need to execute them. This paper documents the experience derived from the process, as well as the technique used to test this new implementation against an existing one by using a blackbox approach.