完整後設資料紀錄
DC 欄位語言
dc.contributor.authorLin, Ying-Daren_US
dc.contributor.authorChou, Chi-Hengen_US
dc.contributor.authorLai, Yuan-Chengen_US
dc.contributor.authorHuang, Tse-Yauen_US
dc.contributor.authorChung, Simonen_US
dc.contributor.authorHung, Jui-Tsunen_US
dc.contributor.authorLin, Frank C.en_US
dc.date.accessioned2014-12-08T15:21:09Z-
dc.date.available2014-12-08T15:21:09Z-
dc.date.issued2012-01-01en_US
dc.identifier.issn0164-1212en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.jss.2011.05.021en_US
dc.identifier.urihttp://hdl.handle.net/11536/15013-
dc.description.abstractSoftware developers frequently conduct regression testing on a series of major, minor, or bug-fix software or firmware releases. However, retesting all test cases for each release is time-consuming. For example, it takes about 36 test-bed-days to thoroughly exercise a test suite made up of 2320 test cases for the MPLS testing area that contains 57,758 functions in Cisco IOS. The cost is infeasible for a series of regression testing on the MPLS area. Thus, the test suite needs to be reduced intelligently, not just randomly, and its fault detection capability must be kept as much as possible. The mode of safe regression test selection approach is adopted for seeking a subset of modification-traversing test cases to substitute for fault-revealing test cases. The algorithms, CW-NumMin, CW-CostMin, and CW-CostCov-B, apply the safe-mode approach in selecting test cases for achieving full-modified function coverage. It is assumed that modified functions are fault-prone, and the fault distribution of the testing area is Pareto-like. Moreover, we also assume that once a subject program is getting more mature, its fault concentration will become stronger. Only function coverage criterion is adopted because of the scalability of a software system with large code. The metrics of test's junction reachability and function's test intensity are defined in this study for algorithms. Both CW-CovMax and CW-CostMin algorithms are not safe-mode, but the approaches they use still attempt to obtain a test suite with a maximal amount of function coverage under certain constraints, i.e. the effective-confidence level and time restriction. We conclude that the most effective algorithm in this study can significantly reduce the cost (time) of regression testing on the MPLS testing area to 1.10%, on the average. Approaches proposed here can be effectively and efficiently applied to the regression testing on bug-fix releases of a software system with large code, especially to the releases having very few modified functions with low test intensities. (C) 2011 Elsevier Inc. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectRegression testingen_US
dc.subjectTest case selectionen_US
dc.subjectTest coverageen_US
dc.subjectTest intensityen_US
dc.subjectSoftware maintenanceen_US
dc.titleTest coverage optimization for large code problemsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.jss.2011.05.021en_US
dc.identifier.journalJOURNAL OF SYSTEMS AND SOFTWAREen_US
dc.citation.volume85en_US
dc.citation.issue1en_US
dc.citation.spage16en_US
dc.citation.epage27en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.department電信工程研究所zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.contributor.departmentInstitute of Communications Engineeringen_US
dc.identifier.wosnumberWOS:000297892900003-
dc.citation.woscount1-
顯示於類別:期刊論文


文件中的檔案:

  1. 000297892900003.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。