DocumentCode :
2988739
Title :
A novel approach to protocol test sequence generation
Author :
Vuong, Son T. ; Ko, Kai C.
Author_Institution :
Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada
fYear :
1990
fDate :
2-5 Dec 1990
Firstpage :
1880
Abstract :
A novel approach for test sequence generation based on the constraints satisfaction problem (CSP) in artificial intelligence is proposed. The proposed method constructs a unique test sequence for the entire finite state machine (FSM) by incrementally generating a set of test subsequences which represent the constraints imposed on the overall structure of the FSM. The resulting test sequence not only has a fault coverage which is at least as good as that provided by current methods, but it also has a better worst-case upper bound on its length. The method also lends itself naturally on both test result analysis and fault coverage measurement
Keywords :
artificial intelligence; binary sequences; protocols; telecommunications computing; testing; artificial intelligence; constraints satisfaction problem; fault coverage measurement; finite state machine; protocol test sequence generation; test result analysis; test subsequences; upper bound; Artificial intelligence; Automata; Communication networks; Computer networks; Computer science; Data analysis; Distributed computing; Protocols; System testing; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference, 1990, and Exhibition. 'Communications: Connecting the Future', GLOBECOM '90., IEEE
Conference_Location :
San Diego, CA
Print_ISBN :
0-87942-632-2
Type :
conf
DOI :
10.1109/GLOCOM.1990.116807
Filename :
116807
Link To Document :
بازگشت