PROGRAM VERIFICATION STRATEGY AND EDGE RANKING OF GRAPHS

There are several criteria for testing program correctness. In this paper we deal with the problem of automatic software testing under the assumption that the set of tests (assertions) is given for selected blocks of code. We simplify the analysis by assuming that the program being tested contains exactly one bug, but this does not lead to loss of generality. We consider not only practical aspects of the above problem and a graph-theoretical model in general but some chromatic aspects of a graph searching model as well