Algorithms that compute test drivers in object oriented testing

Program testing has been a successfully established and implemented issue for the imperative paradigm. On the other hand, program testing for object-oriented (OO) is being constantly revisited and discussed. In this paper we present algorithms that compute the number of test drivers needed in testing OO systems. Testing OO programs would have been a done issue a long time ago if the imperative techniques were sufficient for that paradigm. However, more powerful and rigorous algorithms are significantly needed for OO programs since they differ in features and concepts than the imperative ones. In this study we have intended to make such a need, a primary goal.