Formal methods and testing are two important approaches that assist in the development of
high-quality software. While traditionally these approaches have been seen as rivals, in …

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 …

The paper addresses the problem of conformance test generation from input/output FSMs
that might be partially specified and nondeterministic. Two conformance relations are …

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 …

The paper addresses the problem of adaptive testing of a deterministic FSM which models
an implementation under test using a nondeterministic FSM as its specification. It elaborates …

We present methods for testing and incremental testing of systems modeled as finite state
machines with timeouts (TFSMs). For testing, we establish an appropriate fault model and …

We advocate a fusion of property-oriented testing (POT) and model-based testing (MBT).
The existence of a symbolic finite state machine (SFSM) model fulfilling the properties of …

The main objective of this article is to present a complete finite black-box testing theory for
non-deterministic Kripke structures with possibly infinite input domains, but finite domains for …

Formal methods and testing are two important approaches that assist in the development of
high quality software. While traditionally these approaches have been seen as rivals, in …