An Algorithm for Testing the Unreachable Instruction of an Assembly Program in Software Coverage Testing

Article Preview

Abstract:

Coverage testing is a basic method for dynamic software testing. Based on the basic block theory, 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.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

245-248

Citation:

Online since:

July 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Tang Ke, Wang Wenyong, Liu Limei. Research of embedded software coverage testing [J]. Journal of Chengdu University of Information Technology, 2005(5), Vol. 20.

Google Scholar

[2] Li Wei, Cheng Zhaohui. Research of embedded software test strategy [J]. Journal of Beijing University of Chemical Technology, 2007(1), Vol. 20.

Google Scholar

[3] [Cao Xiaopeng. Study on the method of embedded software testing [J]. Journal of Xi'an Institute of Posts and Telecommunications, 2007(5)Vol. 12.

Google Scholar

[4] Chen Lirong, Xiong Guangze, Luo Lei. Dynamic test software coverage testing [J]. Microcontroller & Embedded Systems, (2002).

Google Scholar