A Pairwise T-Way Test Suite Generation Strategy Using Gravitational Search Algorithm
Khin Maung Htay, Rozmie Razif Othman, Amiza Amir, Hasneeza Liza, Zakaria, Nuraminah Ramli

TL;DR
This paper introduces PGSAS, a novel pairwise t-way test suite generation method using the Gravitational Search Algorithm, which aims to optimize test suite size and improve testing efficiency.
Contribution
The paper presents a new GSA-based approach for pairwise test suite generation, demonstrating competitive performance against existing strategies.
Findings
PGSAS produces smaller test suites in many cases.
It outperforms some existing strategies in certain configurations.
Preliminary results show promising efficiency improvements.
Abstract
Software faults are commonly occurred due to interactions between one or more input parameters in complex software systems. Software test design techniques can be implemented to ensure the quality of the developed software. Exhaustive testing tests all possible test configurations; however, it is infeasible considering time and resource constraints. Pairwise t-way testing is a sampling strategy that focuses on testing every pair of parameter combination, effectively reducing the generated test size as opposed to testing exhaustively. In this paper, we propose a new pairwise t-way strategy called Pairwise Gravitational Search Algorithm Strategy (PGSAS). PGSAS utilizes Gravitational Search Algorithm (GSA) for generating optimal pairwise test suites. The performance of PGSAS is benchmarked against existing t-way strategies in terms of test suite size. Preliminary results showcase that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
