The Study on the Path Covered Completely Test Based on Change

Liu Ji-hua, Chen Ce · 2012

In order to solve the problem that the test cases generated from the path completely covered based on the search on state node are too much and difficult to achieve continuous test, it is necessary to put forward a test criteria based on the change completely path coverage, design and implement a automatic generation algorithm (DWFS algorithm) combining the depth first search and width first search based on change completely path coverage test cases. The experimental results show that the standards based on the change of the complete path coverage are more stringent than based on the state completely covered, and the corresponding DWFS algorithm can produce better test suite and can more easily accomplish software continuous dynamic test.

Read the paper · More papers on PaperTik