Coverall algorithm for test case reduction

This paper proposes a technique called Coverall algorithm, which is based on a conventional attempt to reduce cases that have to be tested for any given software. The approach utilizes the advantage of regression testing where fewer test cases would lessen time consumption of the testing as a whole. The technique also offers a means to perform test case generation automatically. Compared to most of the techniques in the literature where the tester has no option but to perform the test case generation manually, the proposed technique provides a better option. As for the test cases reduction, the technique uses simple algebraic conditions to assign fixed values to variables (maximum, minimum and constant variables). By doing this, the variables values would be limited within a definite range, resulting in fewer numbers of possible test cases to process. The technique can also be used in program loops and arrays. After a comparative assessment of the technique, it has been confirmed that the technique could reduce number of test cases by more than 99%. As for the other features of the technique, automatic test cases generation, all four step of test cases generation in the proposed technique have been converted into an operational program. The success of the program in performing these steps is indeed significant since it represents a practical means for performing test cases generation automatically by a computer algorithm