TY - GEN
T1 - Simplified branch marking algorithm based on decision-to-decision graph
AU - Yikun, Zhang
AU - Enhui, Chen
AU - Junli, Liang
AU - Xinhong, Hei
AU - Hui, Xia
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=70449596270&partnerID=8YFLogxK
U2 - 10.1109/NISS.2009.165
DO - 10.1109/NISS.2009.165
M3 - 会议稿件
AN - SCOPUS:70449596270
SN - 9780769536873
T3 - Proceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009
SP - 433
EP - 438
BT - Proceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009
T2 - 2009 International Conference on New Trends in Information and Service Science, NISS 2009
Y2 - 30 June 2009 through 2 July 2009
ER -