Time Aware Test Case Prioritization based on Fault Coverage using Binary Integer Programming

Test prioritization schemes typically create a single re-ordering of test cases of the test suite that can be executed after many subsequent changes to the program under test. Test case prioritization techniques reorder the execution of test cases in test suite is an attempt to ensure that defects are revealed earlier in the test execution phase. If testing must be terminated early, a reordered test suite can also be more effective at finding faults than one that was not prioritized. Using the preceding BIP approach, we can select a subset of test cases that can satisfy the time budget and maximize the number of faults covered by the selected test cases. However; there may be some unselected test cases that, if further selected, cannot exceed the time budget. Further selecting such test cases cannot increase the number of faults covered. In this paper discussed about time Aware Test Case Prioritization based on Fault Coverage and the implementation of Fault Coverage using Binary Integer Programming