基於需求涵蓋率的測試案例篩選與排程

Test Case Selection and Scheduling Based on Requirement Coverage

林芝妤(Jhih-Yu Lin)

指導教授 ： 陳育欣

中原大學/工學院/工業工程研究所/碩士(2014年)

https://doi.org/10.6840/cycu201400831

摘要

本文運用杜鵑搜尋演算法於需求涵蓋率為篩選條件之測試套件最小化問題以及測試案例間具優先順序限制下之分配測試案例與測試人員問題求解最小測試完工時間，後續探討不同的需求涵蓋率設定對其測試完工時間之影響。
由於杜鵑搜尋屬萬用啟發式演算法中發展較新的一支，運用於最佳化問題的研究相對較稀少，因此本研究利用杜鵑搜尋作為求解的方法，運用在軟體測試及排程派工的範疇中。而在過去探討測試套件最小化問題中以需求涵蓋率作為篩選條件的相關研究大多不討論需求涵蓋率的設定值與測試所需時間的關係，本文中以不同的需求涵蓋率設定進行實驗，找出具有最大效益的設定值可大幅縮減測試所需時間。
本研究利用杜鵑搜尋演算法與模擬退火演算法及隨機挑選方法進行結果比較，經由測試案例數目的縮減及符合優先限制的排程後，最終求得的測試完工時間顯示杜鵑搜尋演算法在此問題上有最佳的表現，可找出整體所需測試時間較短的測試套件。最後運用杜鵑搜尋給予不同的需求涵蓋率值所進行的實驗中，由結果數據可明顯看出在需求涵蓋率為95%的情況下，可縮減近30%的測試所需時間。

關鍵字

測試套件最小化 ； 優先順序限制 ； 平行機台排程 ； 軟體測試 ； 杜鵑搜尋

並列摘要

This paper considers the test suite reduction problem which uses requirements coverage as test adequacy criteria and multiple testers scheduling problem with test case precedence constraints. The objective is to minimize the test completion time by determining the allocation and sequence of test cases on multiple testers. Follow-up on discuss how the requirements coverage affects the performance of the test completion time.
Cuckoo search is a newly developed meta-heuristic algorithm was only proposed in few studies to solve optimization problem. Therefore in the paper cuckoo search is proposed to solve this problem. In previous literatures, the relationship between the difference in require-ments coverage and the test completion time is rarely discussed. In order to find the most suitable requirements coverage which has the maximum effectiveness from reducing test completion time, experiments with different requirements coverage were conducted.
Computational experiments are executed and the results show that the proposed cuckoo search yields better solutions in comparison with the simulation annealing algorithm and ran-dom selection algorithm. Finally, the result of most suitable requirements coverage shows that when the ratio comes to 95%, it can save almost 30% of the test completion time.

並列關鍵字

software testing ； cuckoo search ； test suite reduction ； precedence constraints ； parallel machine scheduling

參考文獻

宋榮浚. 2013. "測試案例篩選與分配於多測試者下測試完成時間最小化問題." 碩士 碩士論文, 工業與系統工程研究所, 中原大學.

Feng, Y. H., K. Jia, and Y. C. He. 2014. "An Improved Hybrid Encoding Cuckoo Search Algorithm for 0-1 Knapsack Problems." Computational Intelligence and Neuroscience:9. doi: 10.1155/2014/970456.

Osman, Ibrahim H., and Gilbert Laporte. 1996. "Metaheuristics: A bibliography." Annals of Operations Research 63 (5):511-623

Boehm, Barry W. 1984. "Verifying and validating software requirements and design specifications."

Boehm, Barry W. 1988. "A spiral model of software development and enhancement." Computer 21 (5):61-72.