Greedy Interaction Elements Coverage Analysis for AI-Based T-Way Strategies

Malaysian Journal of Computer Science

AbdulRahman A. Al-Sewari¹  Kamal Zuhairi Zamli¹  Norazlina Khamis¹ 

关键词: Software Engineering;    Interaction Testing;    T-Way Testing;    Harmony Search Algorithm;   

DOI  :  

学科分类：社会科学、人文和艺术（综合）

来源: University of Malaya * Faculty of Computer Science and Information Technology

【 摘 要 】

Recently, many researchers have started to adopt Artificial Intelligence AI-based strategies for t-way testing.Here, each interaction is covered at most once whenever possible. In many AI-based strategies, sampling forthe most optimal test cases is given utmost priority, but measuring of the interaction coverage metric per testcase is often neglected. In the situation where not all test cases can be executed due to constraints on projectdeadline, the availability of interaction coverage metric per test case can be a useful indicator on how greedyeach AI-based strategy of interests is. In this manner, test engineers can make informed decision on theselection of suitable strategies for use. In this paper, this study presents a systematic analysis of existing AIbasedstrategies including that of Hill Climbing HC, Simulated Annealing SA, Tabu Search TS, Great FloodGF, Particle Swarm Optimization PSTG and Harmonic Search Strategy HSS as far as its rate of coverage pertest case is concerned. In doing so, this paper demonstrates that HSS, in most cases, gives competitiveinteraction coverage rate as compared to competing AI-based strategies but with less number of iterations.

【 授权许可】

Unknown