The problem of tested elements reduction in structural program testing

An approach to the tested elements reduction problem, in which a set of reduction rules is developed to detect the dominated tested elements and remove them is proposed. The dominant elements are then manifested. These reduction rules are formally proved mathematically. The physical meaning of each rule is described in detail. Their effectiveness is illustrated by examples. The proposed table-reduction approach is a generalized method for all kinds of coverage criteria, including individual, local, and mixed coverage criteria.<
>