Refurbishment of object-oriented code: A methodical approach to minimize program complexity

In order to determine software testing competence, test coverage analysis techniques are commonly implemented. The uncovered areas or statements of a program are identified using a technique that employs a set of test cases best suited for the program. Depending on the current approach or the complexity of the program, the concept of test coverage is especially useful in identifying and eliminating test cases that do not contribute significantly to achieving the desired output. In other words, this technique helps in making a program more robust and error-free. It is also useful for identifying sections of a requirement that are not covered by existing test cases. The technique is helpful in creating new test cases to enhance the coverage of a program. As a rigorous quality control practice, it supports the development of experimental test coverage metrics. Therefore, ineffective test scenarios that do not contribute to increased coverage should be tracked and eliminated, thereby reducing the overall complexity of the program. Our approach in this paper aims to create a Control Flow Graph (CFG) for randomly generated object-oriented programs in Java and assess the cyclomatic complexity for each by analyzing the nodes and edges using the traditional formula from the software engineering paradigm. We then identify the best approach to write the program by applying prioritization techniques to the calculated complexity values of the object-oriented programs. This enables us to minimize the complexity of the program during the code development process.