A formal approach to robustness testing of network protocol with time constraints
Network protocols often have time constraints. Robustness testing of network protocol with time constraints aims to detect vulnerabilities of its implementation. However, related theory is not well developed. This paper proposes a novel Timed NPEFSM model containing sufficient inputs with various time values and their processing rules to formalize complex protocol with time constraints. In order to test delay transitions, Grid Timed NPEFSM is proposed and it can be generated by state characterization of Timed NPEFSM based on time sampling. Thus, these two models jointly guide robustness testing of protocol with time constraints. For test generation, we propose timed anomalous test case in which only state under test is characterized by time sampling and this method can simplify test sequences largely without compromising test coverage. We also propose several strategies to construct test sequences for timed transitions. To inject test data efficiently and effectively, three types of timed compound anomalous test cases are proposed and the algorithm of generating timed compound anomalous test cases considering both single-field and multi-field mutations is then presented. Standard test specification language TTCN-3 is extended to describe timed compound anomalous test case. We illustrate our test method using an intra-domain routing protocol OSPFv2. Copyright (C) 2010 John Wiley & Sons, Ltd.
robustness testing ttcn-3 protocol testing timed testing efsm