Abstract-In this paper, we consider a test derivation strategy for testing protocol implementations based on Finite State Machines with timeouts. The strategy is applied for testing TFTP implementations. Keywords-Finete State Machine (FSM); FSM with timeouts (timed FSM); transition tour I.INTRODUCTION FSM-based test derivation strategies for conformance testing of protocol implementations are well known [see, for example, 1-3] and a number of formal methods were developed for deriving tests which check time constraints of a discrete event system implementation. Some of them use FSM-based strategies for test derivation [4][5][6][7][8][9][10][11]. One of such strategies uses the model of a timed FSM (TFSM) with so-called timeouts [7][8][9][10][11], i.e., if no input is applied during an appropriate time period the FSM can move to another prescribed state. Correspondingly, the behavior of an FMS significantly depends on a time instance when an input is applied, i.e., the behavior of the FSM is specified for timed input sequences. In [12], it is shown how this behavior can be described by an ordinary FSM with an additional input symbol (a time unit) and thus, despite of the fact that a test suite derived for such an abstract FSM using black-box testing methods returns highly redundant tests, FSM-based test derivation methods can be directly used when deriving tests from an FSM with timeouts. In this paper, we derive a test suite as a transition tour of an appropriate FSM, since W-based testing methods [3] ask for the specification FSM to be complete and deterministic and this usually does not hold for FSMs which describe protocol behavior. We then analyze the fault coverage of a transition tour for TFTP (Trivial File Transfer Protocol) [13] implementations where the behavior significantly depends on timeouts. The contributions of the paper can be summarized as below.

No abstract

The paper presents the experimental results on the fault coverage evaluation of tests for Time and POP3 protocols, which are derived using finite-state-machine methods. MuJava tool is used for the generation of faulty mutants of software protocol implementations.

In this paper, an approach for testing software implementations of telecommunication protocols based on tree finite state machines (FSM) is proposed. The first step is the extraction of the specification Extended FSM from an informal protocol description. The next step is to derive a corresponding EFSM l-equivalent that is a tree FSM. Based on the set of considered faults corresponding sequences of the l-equivalent are included into a test suite. The proposed approach is illustrated by protocol TCP (Windows).

-The paper is devoted to the mutation testing technique that is widely used when testing different software tools. A short survey of existing methods and tools for mutation testing is presented in the paper. We classify existing methods: some of them rely on injecting bugs into a program under test while other use a formal model of the software in order to inject errors. We also provide a short description of existing tools that support both approaches. We further discuss how these two approaches might be combined for the mutation based test generation with the guaranteed fault coverage.