Development of sequence covering search tree for T-WAY test case generator

Abstract

This project presents the development of sequence covering search tree for t-way test case generator. The importance of sequence covering tree is to overcome the limitation of sequence covering array. There are several current research problem occur which is covering array over heterogeneous alphabets, covering array with budget constraints, embedding covering arrays, and minimizing covering arrays. To overcome the current research problem, sequence covering tree is proposed to design. Proposed sequence covering tree is designed with combination of two modules. The first module is n-node tree generation module generate n-node tree. The second module is searching t-way tuple module, which take t-way tuple as input and return true if the t-way tuple is found, otherwise false. The program is analyse using java coverage tools. It brings code coverage analysis directly into the Eclipse workbench. Overall, this project is to reduce the time complexity for software engineer to do the test case generation.