Test development for communication protocols: towards automation

Dssouli, Rachida; Saleh, Kassem; Aboulhamid, E.M.; En‐Nouaary, Abdeslam; Bourhfir, C.

doi:10.1016/s1389-1286(99)00063-8

Cited by 60 publications

(48 citation statements)

References 54 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…EFSMs can model both control and data and a number of standard modelling languages such as Statecharts and SDL can be seen as EFSMs. EFSM based test techniques can be applied to models in such languages [7,8] as well as formalisms such as (UML) Use Cases and Z and in domains such as communication protocols and web services [8], [9], [10], [11], [12], [13], [14].…”

Section: Introductionmentioning

confidence: 99%

An integrated search-based approach for automatic testing from extended finite state machine (EFSM) models

Kalaji

Hierons

Swift

2011

Information and Software Technology

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

An integrated search-based approach for automatic testing from extended finite state machine (EFSM) models

Kalaji

Hierons

Swift

2011

Information and Software Technology

View full text Add to dashboard Cite

“…Because an EFSM specification typically allows an infinite number of executions, it is not possible to determine whether an implementation under test conforms to its specification by considering all executions of the specification. In the last two decades, a number of methods and tools have been proposed for test generation from EFSMs (for survey, see [3,8]) and most of them focus on a family of coverage criteria based on the information of control flow (e.g, states and transitions) and data flow (e.g., definitions and uses of variables).…”

Section: Introductionmentioning

confidence: 99%

“…Widely-used system models in the testing literature include finite state machines (FSMs) and labelled transition systems (LTSs), especially in hardware testing and protocol conformance testing. Testing methods based on such models primarily focus on control flow oriented test generation (for survey, see [3,8,17]). Although these methods are well-suited for hardware circuits and control portions of communication protocols, they are not powerful enough to test complex data-dependent behaviors.…”

Section: Introductionmentioning

confidence: 99%

A Temporal Logic Based Theory of Test Coverage and Generation

Hong

Lee

Sokolsky

et al. 2002

Tools and Algorithms for the Construction and Analysis of Systems

101

View full text Add to dashboard Cite

Abstract. This paper presents a theory of test coverage and generation from specifications written in EFSMs. We investigate a family of coverage criteria based on the information of control flow and data flow and characterize them in the branching time temporal logic CTL. We discuss the complexity of minimal cost test generation and describe a method for automatic test generation which employs the capability of model checkers to construct counterexamples. Our approach extends the range of applications of model checking from formal verification of finite state systems to test generation from finite state systems.

show abstract

“…Inputs are sent from an external tester to the implementation through the interfaces, and the outputs are checked to see if they are as expected. The sequence of input/output pairs is the test sequence, and the number of inputs is the test sequence length [5]. In general, such a test sequence is generated from the protocol specification.…”

Section: Introductionmentioning

confidence: 99%

“…The control portion determines how messages are sent and received. It can be considered a deterministic ² Finite State Machine (FSM) which contains states and transitions [5]. Initially, the FSM is in a specific state called the initial state.…”

Section: Introductionmentioning

confidence: 99%

Executable Test Sequence for the Protocol Data Flow Property

Chen

Formal Techniques for Networked and Distributed Systems

View full text Add to dashboard Cite

Keywords:A new test sequence generation method is proposed for testing the conformance of a protocol implementation to its data portion modeled by an Extended Finite State Machine which is represented by a Data Flow Digraph. All-Use and IOdf-chain are two important criteria in selecting paths from the Data Flow Digraph in order to generate a test sequence which traces the data flow property, but it is a tedious process to select a path which satisfies the criteria while guaranteeing that the generated test sequence is executable (i.e., one that has feasible parameter values.) The proposed four-step method automatizes the selecting process as well as optimizing the test sequence length. First, the Data Flow Digraph is embedded with certain (but not all) parameter values so as to construct a Behavior Machine Digraph where executable test sequences can be directly generated. Second, executable test paths which trace every association defined by each criterion are generated from the Behavior Machine Digraph. Third, the Behavior Machine Digraph is embedded with these test paths so as to construct the SelectUse and SelectIO Digraphs. Finally, the Selecting Chinese Postman Tours of the two digraphs are used to generate the optimally executable test sequences that satisfy the All-Use and IO-df-chain criteria.Conformance testing, executable test sequence, data flow.

show abstract

Test development for communication protocols: towards automation

Cited by 60 publications

References 54 publications

An integrated search-based approach for automatic testing from extended finite state machine (EFSM) models

An integrated search-based approach for automatic testing from extended finite state machine (EFSM) models

A Temporal Logic Based Theory of Test Coverage and Generation

Executable Test Sequence for the Protocol Data Flow Property

Contact Info

Product

Resources

About