Context independent unique sequences generation for protocol testing

Authors:
T. Ramalingom;K. Thulasiraman;Anindya Das
Affiliations:
Bell Northern Research Ltd, Ottawa, Ontario, Canada;School of Computer Science, University of Oklahoma, Norman, OK;School of Computer Science, University of Oklahoma, Norman, OK
Venue:
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Year:
1996

Citing 9
Cited 2

Selecting Software Test Data Using Data Flow Information

IEEE Transactions on Software Engineering
A protocol test generation procedure

Computer Networks and ISDN Systems
An improved protocol test generation procedure based on UIOS

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Specifications of a simplified transport protocol using different formal description techniques

Computer Networks and ISDN Systems
Automatic generation of extended UIO sequences for communication protocols in an EFSM model

IWPTS '94 7th IFIP WG 6.1 international workshop on Protocol test systems
Using Formal Description Techniques: An Introduction to Estelle, Lotos, and SDL

Using Formal Description Techniques: An Introduction to Estelle, Lotos, and SDL
Generating Conformance Test Sequences for Combined Control and Data Flow of Communication Protocols

Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
Test Case Generation for Protocols Specified in Estelle

FORTE '90 Proceedings of the IFIP TC6/WG6.1 Third International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, III
Review: Fault detection and diagnosis capabilities of test sequence selection methods based on the FSM model

Computer Communications

Confirming Configurations in EFSM Testing

IEEE Transactions on Software Engineering
UIOE: a protocol test sequence generation method using the transition executability analysis (TEA)

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A number of test sequence generation methods proposed recently for protocols represented as Extended Finite State Machines (EFSMs) use state identification sequences for checking the states. However, neither a formal definition nor a method of computation of these sequences for an EFSM state is known. In this paper, we define a new type of state identification sequence, called Context Independent Unique Sequence (CIUS) and present an algorithm for computing it. An unified method based on CIUSes is developed for automatically generating executable test cases for both control flow and data flow aspects of an EFSM. In control flow testing, CIUSes are very useful in confirming the tail state of the transitions. In data flow testing, CIUSes improve the observability of the test cases for the def-use associations of different variables used in the EFSM. Unlike general state identification sequences, the use of CIUSes does not increase the complexity of the already intractable feasibility problem in the test case generation.