隨機軟體測試案例排程

Stochastic Software Test Case Scheduling

薛來德(Daniel Suriawidjaja)

指導教授 ： 陳育欣

中原大學/電機資訊學院/工業與系統工程研究所/碩士(2015年)

https://doi.org/10.6840/cycu201500810

摘要

本文運演算法於需求涵蓋率為篩選條件之測試套件最小化問題以及測試案例間具優先順序限制下之分配隨機測試案例與測試人員問題求解最小測試完工時間，後續探討不同的需求涵蓋率設定對其測試完工時間之影響。
Simheuristics法在本文中用來處理問題的隨機性。這種方法結合了啟發式優化和仿真研究。由於杜鵑搜尋屬萬用啟發式演算法中發展較新的一支，運用於最佳化問題的研究相對較稀少，因此本研究利用螢火蟲算法作為求解的方法。
布穀鳥搜索被派往與所提出的螢火蟲算法比較。結果和從實驗討論進行發現，試驗的情況下，要求覆蓋的數目，並在測試的情況下完成時間（完工時間）是強相關，在問候，隨著越來越多的試驗的情況下，總完成時間也將增加。

關鍵字

軟件測試( ； )simheuristic( ； )螢火蟲算法( ； )測試套件減少( ； )並行機調度( ； )隨機執行時間。

並列摘要

This paper consider test suite reduction problem with requirement coverage as test ade-quacy criteria. In this paper, we introduce a stochastic test case execution time to simulate the real world problem where as some error whether in testers or machines to test might occurs. Scheduling were introduced in this paper to dispatch the reduced test suite from test case minimization to the multiple testers. The objective of this study is to simulate the stochastic test case completion time to perform all the test case in the reduced test suite by allocating and sequencing the test cases to the testers.
Simheuristics method were used in this paper to deal with the stochasticity of the prob-lem. This method combines both metaheuristic optimization and simulation to the study. Me-taheuristic that choosen to be used in this study are Firefly algorithm, which is a quite recent swarm intelligence algorithm that already used in few studies to solve scheduling problem.
Cuckoo search were dispatched as comparison with the proposed firefly algorithm. Re-sults and discussion from the experiments conducted found that the number of test cases, re-quirement coverage, and the test case completion time (makespan) are strongly correlated, in regards that with the increasing number of test cases, the total completion time would also in-creases.

並列關鍵字

software testing( ； ) simheuristic( ； )firefly algorithm( ； )test suite reduction( ； ) parallel ma-chine scheduling( ； ) stochastic execution time.

參考文獻

林芝妤. 2014. 基於需求涵蓋率的測試案例篩選與排程, 工業與系統工程研究所, 中原大學, 中原大學.

Baker, Kenneth R., and Dominik Altheimer. 2012. "Heuristic solution methods for the stochastic flow shop problem." European Journal of Operational Research no. 216 (1):172-177. doi: 10.1016/j.ejor.2011.07.021.

Boehm, Barry W. 1984. "Verifying and validating software requirements and design specifications." IEEE software no. 1 (1):75.

Chen, T. Y., and M. F. Lau. 1998. "A new heuristic for test suite reduction." Information and Software Technology no. 40 (5–6):347-354. doi: http://dx.doi.org/10.1016/S0950-5849(98)00050-0.

Chvatal, Vasek. 1979. "A greedy heuristic for the set-covering problem." Mathematics of operations research no. 4 (3):233-235.