New Frontiers in Communication and Intelligent Systems
RAFI: Parallel Dynamic Test-suite Reduction for Software
Authors: Najneen Qureshi, Manish Kumar Mukhija and Satish Kumar
Publishing Date: 30-04-2022
ISBN: 978-81-95502-00-4
Abstract
A pattern in programming testing diminishes the size of a test suite while protecting its general quality. For programming, test cases and a bunch of requirements are given. Each test case is covering a few requirements. In this paper, we will probably discover the technique for test-suite reduction to compute the subset of test cases covering every one of the requirements. While this issue has acquired huge consideration, it is as yet hard to track down the littlest subset of test cases and generally utilized strategies to tackle this issue with inexact arrangements. In this paper, we will likely track down the technique for test-suite reduction to find the subset of test cases that are covering every one of the requirements across renditions. There are as of now existing greedy algorithms and exponential-time algorithms to discover the TRS in a rendition explicit and across adaptations. We proposed another similar greedy heuristic technique RAFI to discover negligible test sets across forms. Our methodology shows that: (I) RAFI is a lot quicker than the exponential-time method and roughly multiple times quicker than the traditional greedy technique. (ii) RAFI strategy generally accomplishes a similar decrease rate contrasted with the traditional greedy method.
Keywords
Test-Suite Reduction, Traditional Greedy, Traditional Greedy parallel, Test-Coverage graph, Dynamic Reduction, Flower, RAFI.
Cite as
Najneen Qureshi, Manish Kumar Mukhija and Satish Kumar, "RAFI: Parallel Dynamic Test-suite Reduction for Software", In: Rahul Srivastava and Aditya Kr. Singh Pundir (eds), New Frontiers in Communication and Intelligent Systems, SCRS, India, 2022, pp. 165-176. https://doi.org/10.52458/978-81-95502-00-4-20