Simplified Branch Marking Algorithm Based on Decision-to-Decision Graph

Marking branch status has wide applications in dynamic software testing procedures, but it is of low efficiency due to a large number of redundant detection points. To simplify this procedure, this paper proposes a novel algorithm for marking key branches and determining the branch coverage by using decision-to-decision (DD) graph. Compared with the existing ones, the proposed algorithm can efficiently reduce redundant detection points, and thus the least and most key detection points are found. Finally, the experiment results validate the performance of the proposed method.