Validation of SDL-based architectural design models using communication-based coverage criteria

IEICE Trans. Inf. & Syst.

et al. 2015

SUMMARYThe researches on model-based testing mainly focus on the models with single component, such as FSM and EFSM. For the network protocols which have multiple components communicating with messages, CFSM is a widely accepted solution. But in some network protocols, parallel and data-shared components maybe exist in the same network entity. It is infeasible to precisely specify such protocol by existing models. In this paper we present a new model, Parallel Parameterized Extended Finite State Machine (PaP-EFSM). A protocol system can be modeled with a group of PaP-EFSMs. The PaP-EFSMs work in parallel and they can read external variables form each other. We present a 2-stage test generation approach for our new models. Firstly, we generate test sequences for internal variables of each machine. They may be non-executable due to external variables. Secondly, we process the external variables. We make the sequences for internal variables executable and generate more test sequences for external variables. For validation, we apply this method to the conformance testing of real-life protocols. The devices from different vendors are tested and implementation faults are exposed.

Section: Comparison With Related Workmentioning

confidence: 99%

“…But they can only be used to model the protocol with single component. To model and test the protocols with multiple components, the CFSM (Communicating FSMs) is a widely accepted solution [9]- [12]. Actually, CFSMs work well for multiple network entities communicating with asynchronous messages.…”

Section: Introductionmentioning

confidence: 99%

Modeling and Testing of Network Protocols with Parallel State Machines

IEICE Trans. Inf. & Syst.

et al. 2015

“…Lee et al [31] introduce a guided random walk procedure to cover the transitions in CFSM by probability. Restrepo et al [32] present an approach to generate tests with communication-based coverage.…”

Section: Multiple Components Testingmentioning

confidence: 99%

Formal Modeling and Systematic Black-Box Testing of SDN Data Plane

2014 IEEE 22nd International Conference on Network Protocols

et al. 2014

Existing tools for Software-Defined Networking (S-DN) data plane testing can be classified into two classes: whitebox and black-box. For the former, all or part of source codes should be accessed. But for testers outside the manufacturers, the accessing of source code is impossible or very difficult in most cases, especially for hardware devices. For the latter, test cases are manually developed, which cannot ensure the coverage. In this paper, we present a model based black-box systematic testing method for SDN data plane. We propose a new model, Pipelined Extended Finite State Machine (Pi-EFSM), to specify the multiple-level pipeline of SDN data plane. For the Pi-EFSM model, we present a 3-phase systematic test generation approach. By using a hierarchical test generation strategy, the proposed test generation method can alleviate state space explosion to some extent. Our test generation method can achieve the systematic coverage towards the elements of the model. We apply our method in the testing of OpenFlow switches (specification version 1.3.0). We build a Pi-EFSM model for OpenFlow switches and derive the executable test sequences. Some implementation faults and specification confusions are exposed when we test two switches, Open vSwitch 2.1.0 and CPqD OpenFlow 1.3 Software Switch.

“…They computed partial products of each pair of machines instead of complete reachability graph of the whole system. Restrepo et al [23] presented an approach to generated tests from CEFSMs with new criteria aimed at communication-based coverage. CFSM and CEFSM can be used to describe the scenarios in which several protocol components communicate by message exchange, but cannot support the parallel components sharing variables in a same protocol entity.…”

Section: Introductionmentioning

confidence: 99%

“…Then it scans the label queue (Line 7), which ensures that each label in this reachability graph can be dealt with sequentially and the labels not in this reachability graph can be skipped (Line 8-9). The main part of this algorithm is a searching action modified from classical BFS (Breadth-First Search) (Line [10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25]. For each Sync Label, we perform a round of BFS with a priority queue.…”

mentioning

confidence: 99%

Reachability Graph Based Hierarchical Test Generation for Network Protocols Modeled as Parallel Finite State Machines

2013 22nd International Conference on Computer Communication and Networks (ICCCN)

et al. 2013

Current researches on model-based testing mainly focus on the single component model, such as FSM (Finite State Machine) and EFSM (Extended FSM). To model and test parallelism and concurrency among different protocol components, traditional CFSM (Communicating FSMs) models communication as asynchronous message exchange, which is not suitable for the scenario that parallel protocol components read shared variables from each other. We have developed Parallel Parameterized Extended Finite State Machine (PaP-EFSM) to handle this situation. In this paper, we present a hierarchical test generation approach for PaP-EFSMs based on reachability graphs. The combination of bottom-up reachability graph generation and topdown test sequence generation ensures the executability of the test sequences and alleviates state explosion. We apply this methodto the conformance testing of SAVI, a real protocol for antispoofing of IP source addresses. We build a set of PaP-EFSMs for SAVI and derive the executable test sequences, which expose many implementation faults when applied to real devices from 4 different vendors.