Abstract:

Since McCabe proposed the basic path testing method, researchers has been exploring the efficient algorithm of acquiring the basic path set from a program. Therefore, a path string combination algorithm is proposed to obtain the basis path set. In this algorithm, a program is regarded as a combination of several basic structures, the composition and combination of the basic structure of the path string are created, and the combination rules of the path string are designed. Then, according to these rules, the algorithm of obtaining the basic path set is derived. Experiments show that, under the condition of meeting the same coverage criteria, the algorithm is more concise than the method proposed by McCabe and the intermediate results are easy to understand so as to facilitate the optimization of the artificial test case set.

Key words: path string；basic path testing；basic path set；whitebox testing