DocumentCode :
2896508
Title :
Prioritized Test Generation Strategy for Pair-Wise Testing
Author :
Gao, Jianhua ; Zhu, Jie
Author_Institution :
Dept. of Comput. Sci. & Eng., Shanghai Normal Univ., Shanghai, China
fYear :
2009
fDate :
16-18 Nov. 2009
Firstpage :
99
Lastpage :
102
Abstract :
Pair-wise testing is widely used to detect faults in software systems. In many applications where pair-wise testing is needed, the whole test set can not be run completely due to time or budget constraints. In these situations, it is essential to prioritize the tests. In this paper, we drive weight for each value of each parameter, and adapt UWA algorithm to generate an ordered pair-wise coverage test suite. UWA algorithm is to accord weights set for each value of each parameter of the system, then produce ordered pair-wise coverage test set for having generated but unordered one. Finally, a greedy algorithm is adopted to prioritize generated pair-wise coverage test set with driven weights, so that whenever the testing is interrupted, interactions deemed, most important are tested.
Keywords :
program testing; UWA algorithm; ordered pair-wise coverage test; pair-wise testing; prioritized test generation; software fault detection; updating weight algorithm; Application software; Computer science; Costs; Fault detection; Fault diagnosis; Greedy algorithms; Software systems; Software testing; System testing; Time factors; pair-wise testing; test prioritization; weights;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Dependable Computing, 2009. PRDC '09. 15th IEEE Pacific Rim International Symposium on
Conference_Location :
Shanghai
Print_ISBN :
978-0-7695-3849-5
Type :
conf
DOI :
10.1109/PRDC.2009.24
Filename :
5368244
Link To Document :
بازگشت