Home
  • English
  • ÄŒeÅ¡tina
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • LatvieÅ¡u
  • Magyar
  • Nederlands
  • Português
  • Português do Brasil
  • Suomi
  • Log In
    New user? Click here to register. Have you forgotten your password?
Home
  • Browse Our Collections
  • Publications
  • Researchers
  • Research Data
  • Institutions
  • Statistics
    • English
    • ÄŒeÅ¡tina
    • Deutsch
    • Español
    • Français
    • Gàidhlig
    • LatvieÅ¡u
    • Magyar
    • Nederlands
    • Português
    • Português do Brasil
    • Suomi
    • Log In
      New user? Click here to register. Have you forgotten your password?
  1. Home
  2. Research Output and Publications
  3. Faculty of Electronic Engineering & Technology (FKTEN)
  4. Theses & Dissertations
  5. T-Way test suite generator based on gravitational search algorithm
 
Options

T-Way test suite generator based on gravitational search algorithm

Date Issued
2021
Author(s)
Khin Maung Htay
Handle (URI)
https://hdl.handle.net/20.500.14170/2644
Abstract
Due to different users' requirements, contemporary software has become feature-rich in terms of input functions (i.e., parameters) and selections (i.e., values). Exhaustive testing on sophisticated software systems is impractical as far as testing time and cost are concerned. Various software testing techniques such as equivalence class partitioning, boundary value analysis and decision table, have been proposed in the literature with the sole purpose of detecting single-factor faults. Unlike earlier works, combinatorial t-way testing (where t indicates the interaction/combination strength) supports the detection of faults caused by two or more input system parameter interactions (i.e., multi-factor faults) while efficiently minimizing the size of the test suite as compared to exhaustive test lists. Over the past few years, metaheuristic optimization algorithms have appeared to be the most common choice for researchers since their effectiveness proves to offer optimal/near-optimal results. However, as the t-way test suite generation is a Non Deterministic Polynomial Time Hard (NP-hard problem), no single t-way strategy can guarantee superiority to others for all types of system configurations. Hence, this thesis presents a new uniform strength (fixed interaction strength) t-way strategy based on Gravitational Search Algorithm (GSA), called Gravitational Search Test Suite Generator (GSTSG). The key contribution of this research thesis is that the proposed GSTSG strategy employs GSA for the first time for t-way test data generation, which has yet to be explored in software testing research. The benchmarking results showcase that GSTSG obtains competitive results in most system configurations when compared to other existing strategies and addresses higher interaction coverages of up to t = 10 owing to the memoryless feature of GSA. Overall, GSTSG produces optimal test suite sizes in 56.25% of system configurations out of a total of 64 benchmarked configurations. Moreover, the results obtained by GSTSG is statistically significant from other strategies in all multiple comparisons using the Friedman test and also shows differences in 9 paired tests among 15 total pairwise comparisons according to the Wilcoxon Signed Ranks test.
Subjects
  • Generator

  • Combinatorial analysi...

  • Computer software -- ...

  • T-Way

File(s)
Page 1-24.pdf (389.36 KB) Full Text.pdf (1.8 MB) Declaration Form.pdf (303.95 KB)
Views
5
Acquisition Date
Nov 19, 2024
View Details
Downloads
7
Acquisition Date
Nov 19, 2024
View Details
google-scholar
  • About Us
  • Contact Us
  • Policies