An Algorithm for Calculating the Branch Routes of an Assembly Program in Software Coverage Testing

TANG Ke; WANG Wen-yong; XIANG Yu; LUO Guang-chun

PDF
Cite
Share

facebook

twitter

google

linkedin

Volume 34 Issue 2

Dec. 2017

Article Contents

Article Navigation > Journal of University of Electronic Science and Technology of China > 2005 > 34(2): 236-239

TANG Ke, WANG Wen-yong, XIANG Yu, LUO Guang-chun. An Algorithm for Calculating the Branch Routes of an Assembly Program in Software Coverage Testing[J]. Journal of University of Electronic Science and Technology of China, 2005, 34(2): 236-239.

Citation:

TANG Ke, WANG Wen-yong, XIANG Yu, LUO Guang-chun. An Algorithm for Calculating the Branch Routes of an Assembly Program in Software Coverage Testing[J]. Journal of University of Electronic Science and Technology of China, 2005, 34(2): 236-239.

An Algorithm for Calculating the Branch Routes of an Assembly Program in Software Coverage Testing

1.
School of Computer Science and Engineering,UEST of China Chengdu 610054

Received Date: 2004-11-25
Publish Date: 2005-04-15

Abstract

Coverage testing is a basic method for dynamic software testing. An algorithm is proposed for calculating the branch routes of an embedded assembly program in software coverage testing. The correctness of the algorithm is verified on a sample assembly program and it's time complexity is analyzed also.
- coverage testing,
- basic block,
- program flow graph,
- storage matrix,
- adjacency list
References
Proportional views

通讯作者: 陈斌, bchen63@163.com

1.
沈阳化工大学材料科学与工程学院沈阳 110142

Get Citation

PDF

XML

Article Metrics

Article views(3450) PDF downloads(60) Cited by()

Proportional views