DocumentCode
3300239
Title
The Study on the Path Covered Completely Test Based on Change
Author
Liu Ji-Hua ; Chen Ce
Author_Institution
Comput. Sci. & Technol. Dept., Luliang Univ., Luliang, China
fYear
2012
fDate
July 31 2012-Aug. 2 2012
Firstpage
952
Lastpage
957
Abstract
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.
Keywords
program testing; tree searching; DWFS algorithm; automatic generation algorithm; change completely path coverage test cases; depth first search; software continuous dynamic test; state completely coverage; state node; test suite; width first search; Algorithm design and analysis; Monitoring; Search problems; Silicon; Software; Standards; Testing; Completely path coverage; Software testing; Test cases; state chart test;
fLanguage
English
Publisher
ieee
Conference_Titel
Digital Manufacturing and Automation (ICDMA), 2012 Third International Conference on
Conference_Location
GuiLin
Print_ISBN
978-1-4673-2217-1
Type
conf
DOI
10.1109/ICDMA.2012.225
Filename
6298674
Link To Document