DocumentCode
3114797
Title
Building Prioritized Pairwise Interaction Test Suites with Ant Colony Optimization
Author
Chen, Xiang ; Gu, Qing ; Zhang, Xin ; Chen, Daoxu
Author_Institution
Dept. of Comput. Sci. & Technol., Nanjing Univ., Nanjing, China
fYear
2009
fDate
24-25 Aug. 2009
Firstpage
347
Lastpage
352
Abstract
Interaction testing offers a stable cost-benefit ratio in identifying faults. But in many testing scenarios, the entire test suite cannot be fully executed due to limited time or cost. In these situations, it is essential to take the importance of interactions into account and prioritize these tests. To tackle this issue, the biased covering array is proposed and the Weighted Density Algorithm (WDA) is developed. To find a better solution, in this paper we adopt ant colony optimization (ACO) to build this prioritized pairwise interaction test suite (PITS). In our research, we propose four concrete test generation algorithms based on Ant System, Ant System with Elitist, Ant Colony System and Max-Min Ant System respectively. We also implement these algorithms and apply them to two typical inputs and report experimental results. The results show the effectiveness of these algorithms.
Keywords
minimax techniques; program testing; ant colony optimization; ant colony system; ant system with elitist; biased covering array; max-min ant system; prioritized pairwise interaction test suites; weighted density algorithm; Ant colony optimization; Computer science; Concrete; Costs; Fault diagnosis; Laboratories; Partitioning algorithms; Software quality; Software testing; System testing; Software testing; ant colony optimization; prioritized interaction testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Quality Software, 2009. QSIC '09. 9th International Conference on
Conference_Location
Jeju
ISSN
1550-6002
Print_ISBN
978-1-4244-5912-4
Type
conf
DOI
10.1109/QSIC.2009.52
Filename
5381411
Link To Document