標題: An optimal representative set selection method
作者: Lee, JG
Chung, CG
資訊工程學系
Department of Computer Science
關鍵字: testing;optimal representative set;test suite reduction
公開日期: 15-一月-2000
摘要: The optimal representative set selection problem is defined thus: given a set of test requirements and a test suite that satisfies all test requirements, find a subset of the test suite containing a minimum number of test cases that still satisfies all test requirements. Existing methods for solving the representative set selection problem do not guarantee that obtained representative sets are optimal (i.e, minimal). The enhanced zero-one optimal path set selection method [C.G. Chung, J.G. Lee, An enhanced zero-one optimal path set selection method, Journal of Systems and Software, 39(2) (1997) 145-164] solves the so-caned optimal path set selection problem, and can be adapted to solve the optimal representative set selection problem by considering paths as test cases and components to be covered (e.g. branches) as test requirements. (C) 2000 Elsevier Science B.V. All rights reserved.
URI: http://dx.doi.org/10.1016/S0950-5849(99)00052-X
http://hdl.handle.net/11536/30803
ISSN: 0950-5849
DOI: 10.1016/S0950-5849(99)00052-X
期刊: INFORMATION AND SOFTWARE TECHNOLOGY
Volume: 42
Issue: 1
起始頁: 17
結束頁: 25
顯示於類別:期刊論文


文件中的檔案:

  1. 000084754600002.pdf

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