This paper addresses the problem of test generation from partially specified deterministic
finite state machines (FSMs) that may have indistinguishable states and, thus, are not …

A checking sequence, generated from a finite state machine, is a test sequence that is
guaranteed to lead to a failure if the system under test is faulty and has no more states than …

This paper describes a method for automatically generating unique input output (UIO)
sequences for FSM conformance testing. UIOs are used in conformance testing to verify the …

Specification mutation involves mutating a specification, and for each mutation a test is
derived that distinguishes the behaviours of the mutated and original specifications. This …

In testing from a Finite State Machine (FSM), the generation of test suites which guarantee
full fault detection, known as complete test suites, has been a long-standing research topic …

There has been significant interest in automating testing on the basis of an extended finite
state machine (EFSM) model of the required behaviour of the implementation under test …

In this paper we present a method for testing a system against a non-deterministic stochastic
finite state machine. As usual, we assume that the functional behaviour of the system under …

An important concept in finite state machine based testing is synchronization which is used
to initialize an implementation to a particular state. Usually, synchronizing sequences are …

The generation of test data for state-based specifications is a computationally expensive
process. This problem is magnified if we consider that time constraints have to be taken into …

Mutation testing traditionally involves mutating a program in order to produce a set of
mutants and using these mutants in order to either estimate the effectiveness of a test suite …