DocumentCode :
1577080
Title :
An enhanced zero-one optimal path set selection method
Author :
Chung, Chyan-Goei ; Lee, Jen-Gaw
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan
fYear :
1995
Firstpage :
225
Lastpage :
233
Abstract :
Optimal path set selection problem is a crucial issue in structural testing. The zero-one optimal path set selection method is a generalized method that can be applied to all coverage criteria. The only drawback to this method is that for a large program the computation may take ten or more hours because the computation is exponentially proportional to the number of candidate paths and proportional to the number of components to be covered. To alleviate the drawback, this paper enhances the method by: defining five reduction rules: and reusing previously selected path set(s) to reduce both the number of candidate paths and the number of components to be covered. Since both the number of candidate paths and the number of components to be covered are reduced, the computation time can be greatly reduced
Keywords :
integer programming; program debugging; program testing; programming theory; candidate paths; computation time; coverage criteria; integer programming; large program; program testing; reduction rules; structural testing; zero-one optimal path set selection; Computer science; Cost function; Linear programming; Software testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Software Engineering Conference, 1995. Proceedings., 1995 Asia Pacific
Conference_Location :
Brisbane, Qld.
Print_ISBN :
0-8186-7171-8
Type :
conf
DOI :
10.1109/APSEC.1995.496971
Filename :
496971
Link To Document :
بازگشت