CTJ: Input-output based relation combinatorial testing strategy using Jaya algorithm

Software testing is a vital part of the software development life cycle. Most of the time, the system under test has more than one input and testing of every combination of inputs is almost impossible as the time of execution of the test case is outrageously long. Combinatorial testing is the way to...

Full description

Bibliographic Details
Main Authors: Alsewari, Abdulrahman A., Ng, Yeong Khang, Kamal Z., Zamli, Mohammed E., Younis
Format: Conference or Workshop Item
Language:English
English
Published: Universiti Malaysia Pahang 2019
Subjects:
Online Access:http://umpir.ump.edu.my/id/eprint/25763/
http://umpir.ump.edu.my/id/eprint/25763/1/49.%20CTJ-%20input%20output%20based%20relation%20combinatorial%20testing.pdf
http://umpir.ump.edu.my/id/eprint/25763/2/49.1%20CTJ-%20input%20output%20based%20relation%20combinatorial%20testing.pdf
id ump-25763
recordtype eprints
spelling ump-257632019-12-17T03:18:03Z http://umpir.ump.edu.my/id/eprint/25763/ CTJ: Input-output based relation combinatorial testing strategy using Jaya algorithm Alsewari, Abdulrahman A. Ng, Yeong Khang Kamal Z., Zamli Mohammed E., Younis QA76 Computer software Software testing is a vital part of the software development life cycle. Most of the time, the system under test has more than one input and testing of every combination of inputs is almost impossible as the time of execution of the test case is outrageously long. Combinatorial testing is the way to encounter exhaustive testing through the testing of every input values and every combination between parameters. Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). IOR combinatorial testing only tests for the important combinations selected by the tester. Most of the researches in combinatorial testing applied the uniform and the variable interaction strength, however, there is a leak addressing IOR. In this paper, a Jaya algorithm is proposed as an optimization algorithm engine to construct a test list based on IOR in the proposed combinatorial test list generator strategy and named as (CTJ). The result of applying the Jaya algorithm in input-output based combinatorial testing is acceptable since it produces a nearly optimum number of test cases in a satisfactory time range. Universiti Malaysia Pahang 2019 Conference or Workshop Item PeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/25763/1/49.%20CTJ-%20input%20output%20based%20relation%20combinatorial%20testing.pdf pdf en http://umpir.ump.edu.my/id/eprint/25763/2/49.1%20CTJ-%20input%20output%20based%20relation%20combinatorial%20testing.pdf Alsewari, Abdulrahman A. and Ng, Yeong Khang and Kamal Z., Zamli and Mohammed E., Younis (2019) CTJ: Input-output based relation combinatorial testing strategy using Jaya algorithm. In: 2019 IEEE Congress on Evolutionary Computation, 10-14 Jun 2019 , Wellington, New Zealand. pp. 1-10.. (Unpublished)
repository_type Digital Repository
institution_category Local University
institution Universiti Malaysia Pahang
building UMP Institutional Repository
collection Online Access
language English
English
topic QA76 Computer software
spellingShingle QA76 Computer software
Alsewari, Abdulrahman A.
Ng, Yeong Khang
Kamal Z., Zamli
Mohammed E., Younis
CTJ: Input-output based relation combinatorial testing strategy using Jaya algorithm
description Software testing is a vital part of the software development life cycle. Most of the time, the system under test has more than one input and testing of every combination of inputs is almost impossible as the time of execution of the test case is outrageously long. Combinatorial testing is the way to encounter exhaustive testing through the testing of every input values and every combination between parameters. Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). IOR combinatorial testing only tests for the important combinations selected by the tester. Most of the researches in combinatorial testing applied the uniform and the variable interaction strength, however, there is a leak addressing IOR. In this paper, a Jaya algorithm is proposed as an optimization algorithm engine to construct a test list based on IOR in the proposed combinatorial test list generator strategy and named as (CTJ). The result of applying the Jaya algorithm in input-output based combinatorial testing is acceptable since it produces a nearly optimum number of test cases in a satisfactory time range.
format Conference or Workshop Item
author Alsewari, Abdulrahman A.
Ng, Yeong Khang
Kamal Z., Zamli
Mohammed E., Younis
author_facet Alsewari, Abdulrahman A.
Ng, Yeong Khang
Kamal Z., Zamli
Mohammed E., Younis
author_sort Alsewari, Abdulrahman A.
title CTJ: Input-output based relation combinatorial testing strategy using Jaya algorithm
title_short CTJ: Input-output based relation combinatorial testing strategy using Jaya algorithm
title_full CTJ: Input-output based relation combinatorial testing strategy using Jaya algorithm
title_fullStr CTJ: Input-output based relation combinatorial testing strategy using Jaya algorithm
title_full_unstemmed CTJ: Input-output based relation combinatorial testing strategy using Jaya algorithm
title_sort ctj: input-output based relation combinatorial testing strategy using jaya algorithm
publisher Universiti Malaysia Pahang
publishDate 2019
url http://umpir.ump.edu.my/id/eprint/25763/
http://umpir.ump.edu.my/id/eprint/25763/1/49.%20CTJ-%20input%20output%20based%20relation%20combinatorial%20testing.pdf
http://umpir.ump.edu.my/id/eprint/25763/2/49.1%20CTJ-%20input%20output%20based%20relation%20combinatorial%20testing.pdf
first_indexed 2023-09-18T22:39:45Z
last_indexed 2023-09-18T22:39:45Z
_version_ 1777416835868655616