Year-end Sale % OFF 
Abstract
The current paper illustrates the importance of clustering the frequent items of code coverage during test suite reduction. A modular Most maximal frequent sequence clustered algorithm has been used along with a Requirement residue based test case reduction process. DU-pairs form the basic code coverage requirement under consideration for test suite reduction. This algorithm farewell when compared with few other algorithms like Harrold Gupta and Soffa (HGS) and Bi-Objective Greedy (BOG) algorithms and Greedy algorithms in covering all the DU-Pairs. The coverage criteria achieved is 100% in many cases, except for few insufficient and incomplete test suites. DOI: http://dx.doi.org/10.15181/csat.v2i1.396
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
