CTJ: Input-Output Based Relation Combinatorial Testing Strategy Using Jaya Algorithm

• Main Authors: Mohammed Issam Younis, Abdul Rahman A. Alsewari, Ng Yeong Khang, Kamal Z. Zamli
• Format: Article
• Language: Arabic
• Published: College of Science for Women, University of Baghdad 2020-09-01
• Series: Baghdad Science Journal
• Subjects: Jaya algorithm; software testing; combinatorial testing; t-way testing; system reliability
• Online Access: http://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/3690

Software testing is a vital part of the software development life cycle. In many cases, the system under test has more than one input making the testing efforts for every exhaustive combination impossible (i.e. the time of execution of the test case can be outrageously long). Combinatorial testing offers an alternative to exhaustive testing via considering the interaction of input values for every t-way 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 still a lack of work 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 into a tool called 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.