Using Swarm Intelligence to Generate Test Data for Covering Prime Paths

被引:5
作者
Bidgoli, Atieh Monemi [1 ]
Haghighi, Hassan [1 ]
Nasab, Tahere Zohdi [1 ]
Sabouri, Hamideh [1 ]
机构
[1] Shahid Beheshti Univ, Dept Comp Sci & Engn, GC, Tehran, Iran
来源
FUNDAMENTALS OF SOFTWARE ENGINEERING, FSEN 2017 | 2017年 / 10522卷
关键词
Search based test data generation; Prime paths; Swarm intelligence algorithms; Ant colony optimization; Particle swarm optimization; OPTIMIZATION; COLONY;
D O I
10.1007/978-3-319-68972-2_9
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Search-based test data generation methods mostly consider the branch coverage criterion. To the best of our knowledge, only two works exist which propose a fitness function that can support the prime path coverage criterion, while this criterion subsumes the branch coverage criterion. These works are based on the Genetic Algorithm (GA) while scalability of the evolutionary algorithms like GA is questionable. Since there is a general agreement that evolutionary algorithms are inferior to swarm intelligence algorithms, we propose a new approach based on swarm intelligence for covering prime paths. We utilize two prominent swarm intelligence algorithms, i.e., ACO and PSO, along with a new normalized fitness function to provide a better approach for covering prime paths. To make ACO applicable for the test data generation problem, we provide a customization of this algorithm. The experimental results show that PSO and the proposed customization of ACO are both more efficient and more effective than GA when generating test data to cover prime paths. Also, the customized ACO, in comparison to PSO, has better effectiveness while has a worse efficiency.
引用
收藏
页码:132 / 147
页数:16
相关论文
共 36 条
[1]   A Systematic Review of the Application and Empirical Investigation of Search-Based Test Case Generation [J].
Ali, Shaukat ;
Briand, Lionel C. ;
Hemmati, Hadi ;
Panesar-Walawege, Rajwinder K. .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2010, 36 (06) :742-762
[2]  
Ammann P., 2016, INTRO SOFTWARE TESTI
[3]  
[Anonymous], [No title captured]
[4]   It really does matter how you normalize the branch distance in search-based software testing [J].
Arcuri, Andrea .
SOFTWARE TESTING VERIFICATION & RELIABILITY, 2013, 23 (02) :119-147
[5]  
Ayari K, 2007, GECCO 2007: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, P1074
[6]  
Baresel Andre., 2002, Proceedings of the Genetic and Evolutionary Computation Conference, GECCO '02, P1329
[7]  
Blum Christian, 2008, P43, DOI 10.1007/978-3-540-74089-6_2
[8]   Automatic test data generation for program paths using genetic algorithms [J].
Bueno, PMS ;
Jino, M .
INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING, 2002, 12 (06) :691-709
[9]   Augmenting simulated annealing to build interaction test suites [J].
Cohen, MB ;
Colbourn, CJ ;
Ling, ACH .
ISSRE 2003: 14TH INTERNATIONAL SYMPOSIUM ON SOFTWARE RELIABILITY ENGINEERING, PROCEEDINGS, 2003, :394-405
[10]   Ant system: Optimization by a colony of cooperating agents [J].
Dorigo, M ;
Maniezzo, V ;
Colorni, A .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1996, 26 (01) :29-41