Software testing and retesting occurs continuously during software development life cycle to validate the software from different views. To validate the developed one, time and resource constraints are taken into account; therefore test suite reduction technique (i.e., instead of checking all possible inputs test cases check only essential test cases, but at the same time they must satisfy the complete requirements) is the important thing to be followed to test the developed software. Several test suite reduction techniques are present. My approach is a new type of test suite reduction heuristic in which I propose a new algorithm named a test suite reduction heuristic based on changed condition/coverage criteria (CC/CC) to test the software on satisfying complete user's requirement with less time, cost and more coverage of requirements. The coverage criteria of this approach can get compared with Harold approach and the results are analyzed at the end. To demonstrate the applicability of this approach, I conducted an experimental study which shows results with the benefits of my approach in the above discussed constraints (cost, time &coverage) during software testing.
[...] CONCLUSION AND FUTURE WORK In this paper, a new type of test case reduction based on CC/CC PAIR is proposed with the simple implementation part which indicates that the test case reduction factors namely execution time, cost, requirement coverage are taken into account. In future with the addition to this, it's important to consider the fault detection rate for this test case reduction process and also several steps taken to achieve certain goals Reduce test case further which satisfies complete user requirement. [...]
[...] Similarly for the other requirements required test case are plotted based on the number of test cases required for each requirement.Atlast the required test cases for harrold approach are taken from the section-IV.By this approach, only 5 test cases are needed for satisfy requirement up to 70% level because in the graph it's clearly noted that test case 100 is taken for req10. Which indicates that verification of inputs with correct user name and wrong password but it does not consider about the req9 (i.e.)014 both incorrect username with correct password . [...]
[...] In the next section, the background of CC/CC PAIR definition with its example and test case reduction is discussed. New proposed algorithmic technique is discussed in section3.An experimental implementation is discussed in section4. Performance analysis is discussed in section5.conclusion and future work is discussed in section6. II. BACKGROUND 2.1 CC/CC PAIR and Test Case Reduction: Definition: The CC/CC PAIR is a pair which follows the MC/DC PAIR concept as per given in (i.e. A pair of test cases must contain at least one input same and other inputs are different (replace one by another), but it must always producing the different outputs).and also find the requirement coverage of -selected test case (i.e. [...]
[...] In this paper, I present a new approach named test case reduction heuristic based on CC/CC PAIR which deals with both requirement satisfaction and coverage criteria. In this technique, we select the test cases based on the requirement based coverage (i.e. all user requirements for their applications). The technique first calculates the weight of the all possible generated test cases, and also checks it for the CC/CC (changed condition/coverage criteria) PAIR combination. Note that, weight refers to number of occurrences of particular test case cover different requirement of our application under test. [...]
[...] It's difficult to re-run all the possible test cases during testing as per details given in[5] .It also focuses on reducing test suites to obtain a subset that yields equivalent coverage with respect to some criteria The optimal test suite reduction problem may be stated as follows Given: Test suite TSj a set of test cases tc1, tc2 tcn and the requirements Req1, Req Reqn that must be satisfied to provide the desired test coverage of the program, and subsets of TS1, TS2 TS3, TS m one associated with each of the Reqi's such that any one of the test cases tci belonging to TSj can be used to test Reqi Problem: Find a representative set Rs = { } of test cases from TSj that satisfies all of the Reqi The Reqi in the foregoing statement can represent various test case requirements, such as source statements, decisions, definition-use associations, or specification items A representative set of test cases that satisfies all of the Reqi must contain at least one test case from each TSj; such a set is called a hitting set of the group of sets TS1, TS TSm. [...]
APA Style reference
For your bibliographyOnline reading
with our online readerContent validated
by our reading committee
