Constructing multiple unique input/output sequences using metaheuristic optimisation techniques

被引:23
作者
Guo, Q [1 ]
Hierons, RM
Harman, M
Derderian, K
机构
[1] Brunel Univ, Dept Informat Syst & Comp, Uxbridge UB8 3PH, Middx, England
[2] Kings Coll London, Dept Comp Sci, London WC2R 2LS, England
来源
IEE PROCEEDINGS-SOFTWARE | 2005年 / 152卷 / 03期
关键词
D O I
10.1049/ip-sen:20045001
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Multiple unique input/output sequences (UIOs) are often used to generate robust and compact test sequences in finite state machine (FSM) based testing. However, computing UIOs is NP-hard. Metaheuristic optimisation techniques (MOTs) such as genetic algorithms (GAs) and simulated annealing (SA) are effective in providing good solutions for some NP-hard problems. In the paper, the authors investigate the construction of UIOs by using MOTs. They define a fitness function to guide the search for potential UIOs and use sharing techniques to encourage MOTs to locate UIOs that are calculated as local optima in a search domain. They also compare the performance of GA and SA for UIO construction. Experimental results suggest that, after using a sharing technique, both GA and SA can find a majority of UIOs from the models under test.
引用
收藏
页码:127 / 140
页数:14
相关论文
共 27 条
[1]   AN OPTIMIZATION TECHNIQUE FOR PROTOCOL CONFORMANCE TEST-GENERATION BASED ON UIO SEQUENCES AND RURAL CHINESE POSTMAN TOURS [J].
AHO, AV ;
DAHBURA, AT ;
LEE, D ;
UYAR, MU .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1991, 39 (11) :1604-1615
[2]  
[Anonymous], 1989, GENETIC ALGORITHM SE
[3]  
ATKINSON AC, STAT COMPUT, P221
[4]  
Goldberg D. E., 1987, Genetic Algorithms and their Applications: Proceedings of the Second International Conference on Genetic Algorithms, P41
[5]  
Guo Q, 2004, LECT NOTES COMPUT SC, V2931, P164
[6]   UIO sequence based checking sequences for distributed test architectures [J].
Hierons, RM ;
Ural, H .
INFORMATION AND SOFTWARE TECHNOLOGY, 2003, 45 (12) :793-803
[7]   Testing from a finite-state machine: Extending invertibility to sequences [J].
Hierons, RM .
COMPUTER JOURNAL, 1997, 40 (04) :220-230
[8]   Extending test sequence overlap by invertibility [J].
Hierons, RM .
COMPUTER JOURNAL, 1996, 39 (04) :325-330
[9]  
HOLLAND JH, 1975, ADAPTATION NATURAL A
[10]   UIOE:: a protocol test sequence generation method using the transition executability analysis (TEA) [J].
Huang, CM ;
Chiang, MS ;
Jang, MY .
COMPUTER COMMUNICATIONS, 1998, 21 (16) :1462-1475