The complexity of data flow criteria for test data selection
Information Processing Letters
Selecting Software Test Data Using Data Flow Information
IEEE Transactions on Software Engineering
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
Using Formal Description Techniques: An Introduction to Estelle, Lotos, and SDL
Using Formal Description Techniques: An Introduction to Estelle, Lotos, and SDL
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
Test Generation by Exposing Control and Data Dependencies Within System Specifications in SDL
FORTE '93 Proceedings of the IFIP TC6/WG6.1 Sixth International Conference on Formal Description Techniques, VI
On testing and diagnosis of communication protocols based on the FSM model
Computer Communications
Test generation based on control and data dependencies within system specifications in SDL
Computer Communications
Aiding Test Case Generation in Temporally Constrained State Based Systems Using Genetic Algorithms
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Estimating the feasibility of transition paths in extended finite state machines
Automated Software Engineering
A case study on the use of genetic algorithms to generate test cases for temporal systems
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
Information and Software Technology
Learning and integration of parameterized components through testing
TestCom'07/FATES'07 Proceedings of the 19th IFIP TC6/WG6.1 international conference, and 7th international conference on Testing of Software and Communicating Systems
| Hi-index | 0.24 |
A number of test sequence generation methods proposed for communication 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 first define a new type of state identification sequence, called Context Independent Unique Sequence (CIUS) and present an algorithm for computing it. To demonstrate the usefulness of these sequences, we then briefly describe a unified method based on CIUSs for automatically generating executable test cases for both control flow and data flow aspects of an EFSM. In control flow testing, CIUSs are very useful in confirming the tail states of the transitions. In data flow testing, CIUSs 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 CIUSs does not increase the complexity of the already intractable feasibility testing problem in test case generation. Moreover, the feasibility problem encountered in both the CIUS computation and the test case generation methods is amenable to an incremental solution. We demonstrate this by presenting a method to solve a particular case of this problem in which the variables are of only integer, real or Boolean type and the predicates are linear.