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

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

Full description

Bibliographic Details
Main Author:	Ng, Yeong Khang
Format:	Undergraduates Project Papers
Language:	English
Published:	2019
Subjects:	QA76 Computer software
Online Access:	http://umpir.ump.edu.my/id/eprint/27273/ http://umpir.ump.edu.my/id/eprint/27273/ http://umpir.ump.edu.my/id/eprint/27273/1/CTJ%20-%20Input-output%20based%20relation%20combinatorial%20testing%20strategy%20using%20jaya.pdf

id	ump-27273
recordtype	eprints
spelling	ump-272732020-01-07T09:57:29Z http://umpir.ump.edu.my/id/eprint/27273/ CTJ: Input-output based relation combinatorial testing strategy using Jaya algorithm Ng, Yeong Khang QA76 Computer software Software testing is a vital part in software development lifecycle. Most of the time, system under test has more than one input and testing of every combinations of inputs is almost impossible as the time of execution of 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 test for the important combinations that selected by tester. Most of the researches in combinatorial testing applied uniform and variable interaction strength but there are only few studies feature IOR. Thus, IOR combinatorial testing is selected to be studied in this research. To overcome the combinatorial optimization problem, Jaya algorithm is proposed to apply in this project since metaheuristic algorithm is fast in optimization and this strategy is named as CTJ. The result of applying Jaya algorithm in input-output based combinatorial testing is acceptable since it produces nearly optimum number of test cases in the satisfactory time range. 2019-01 Undergraduates Project Papers NonPeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/27273/1/CTJ%20-%20Input-output%20based%20relation%20combinatorial%20testing%20strategy%20using%20jaya.pdf Ng, Yeong Khang (2019) CTJ: Input-output based relation combinatorial testing strategy using Jaya algorithm. Faculty of Computer System & Software Engineering, Universiti Malaysia Pahang. http://fypro.ump.edu.my/ethesis/index.php
repository_type	Digital Repository
institution_category	Local University
institution	Universiti Malaysia Pahang
building	UMP Institutional Repository
collection	Online Access
language	English
topic	QA76 Computer software
spellingShingle	QA76 Computer software Ng, Yeong Khang CTJ: Input-output based relation combinatorial testing strategy using Jaya algorithm
description	Software testing is a vital part in software development lifecycle. Most of the time, system under test has more than one input and testing of every combinations of inputs is almost impossible as the time of execution of 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 test for the important combinations that selected by tester. Most of the researches in combinatorial testing applied uniform and variable interaction strength but there are only few studies feature IOR. Thus, IOR combinatorial testing is selected to be studied in this research. To overcome the combinatorial optimization problem, Jaya algorithm is proposed to apply in this project since metaheuristic algorithm is fast in optimization and this strategy is named as CTJ. The result of applying Jaya algorithm in input-output based combinatorial testing is acceptable since it produces nearly optimum number of test cases in the satisfactory time range.
format	Undergraduates Project Papers
author	Ng, Yeong Khang
author_facet	Ng, Yeong Khang
author_sort	Ng, Yeong Khang
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
publishDate	2019
url	http://umpir.ump.edu.my/id/eprint/27273/ http://umpir.ump.edu.my/id/eprint/27273/ http://umpir.ump.edu.my/id/eprint/27273/1/CTJ%20-%20Input-output%20based%20relation%20combinatorial%20testing%20strategy%20using%20jaya.pdf
first_indexed	2023-09-18T22:42:48Z
last_indexed	2023-09-18T22:42:48Z
_version_	1777417027487531008

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

Similar Items