The use of class graph to analyze the effectiveness of an approach for object-oriented class-level testing

In order to improve reliability and quality, software systems should be tested. The testing of object-oriented software systems is more complex than that of traditional programming. Recently, we have proposed an approach to select a finite number of representative equivalent pairs as test cases from the infinite set of all equivalent pairs. The approach is based on the concept of equivalent fundamental pairs. We analyze the effectiveness of this approach using a class graph. A class graph can be derived from the syntax declaration of the algebraic specification for the given class under test. Using the class graph, we show that our approach omits many testing paths in the class graph but doesn't reduce the testing effect. Hence, the testing efficiency is improved greatly.