الفهرس 
Chapter 1Only 14 pages are availabe for public view
 |  | from | 117 |  |  |
| | | from | 117 | | |
Abstract
Test Suite Minimization problem is a nondeterministic polynomial time (NP)brcomplete problem in software engineering that has a special importance in software testing. In this problem, a subset with a minimal size that contains a number of test cases that cover all the test requirements should be found A brute-force approach to solve this problem is to assume a size for the min imal subset and then search to and if there is a subset of test cases with the assumed size that solves the problem. If not, the assumed minimal size is gradually incremented, and the search is repeated.