Executable test sequence for the protocol control and data flow property with overlapping
Tóm tắt
We improve an earlier test sequence generation method for testing the conformance of a protocol implementation to its specification modeled by an extended finite state machine (EFSM) represented by a flow digraph. The earlier method produces an executable test sequence (i.e., one that has feasible parameter values) that covers a set of define-clear-use paths of the flow digraph for testing the data portion of the EFSM. We first overlap these define-clear-use paths into a shorter executable test sequence that tests the data portion. Second, we overlap the new test sequence with a set of transition-verifying paths for testing the control portion.
Từ khóa
#Protocols #Automata #Communication system control #Distributed computing #Instruments #Communication cables #Optical fiber cables #Optical fiber communication #Optical fiber testing #HardwareTài liệu tham khảo
10.1016/S1389-1286(99)00063-8
10.1007/0-306-47003-9_18
uyar, 1987, Optimal test sequence generation for protocols: The Chinese Postman Algorithm applied to Q. 931, Proc of IEEE Global Telecommunication Conference
10.1016/S0020-0190(97)00208-1
10.1016/S0140-3664(98)00172-8
10.1016/S0140-3664(99)00227-3
schwartz, 1987, Telecommunication Networks Protocols Modeling and Analysis
schrage, 1991, LINDO 5 0 User's Manual
sidhu, 1987, Experiences with test generation for real protocols, Computer Communications, 10
1991, International Organization for Standardization-Information Technology-Open Systems Interconnection
10.1109/INFCOM.1993.253292