Title :
Towards automatic generation of test data using branch coverage
Author :
Chen, Jifeng ; Yang, Luming
Author_Institution :
Sch. of Inf. Sci. & Eng., Central South Univ., Changsha, China
Abstract :
By analyzing various methods of automatic generation of test data using branch coverage, their characteristics and disadvantages are discussed, a new algorithm for automatic generation of test data is proposed. Through constructing the new procedure flow chart, the algorithm optimizes the selection paths using Fibonacci law, and generates test data for assigned branch. When the branch predicates of the chosen path are linear representation, solve the linear restraint set directly to generate test data, otherwise determine that the path is inaccessible; When the branch predicate composing of nonlinear expression, linearize nonlinear function by using the divided difference approximate derivative to ensure the test data can easily generated through simple iteration, or conclude that path is inaccessible to a large extent. If the chosen path is to a large extent inaccessible or inaccessible, then a new path is selected, repeat the above process until the desired data obtained, if no new path was chosen, then the specified branch was inaccessible. Experiments show that the algorithm is feasible and valid.
Keywords :
optimising compilers; program testing; Fibonacci law; automatic test data generation; branch coverage; branch predicate; divided difference approximate derivative; flow chart; iterative method; linear representation; nonlinear function; selection path optimisation; Algorithm design and analysis; Automatic testing; Character generation; Computer science; Computer science education; Data engineering; Flowcharts; Information analysis; Information science; Software testing; Branch coverage; Linear arithmetic representation; Predicate function;
Conference_Titel :
Computer Science & Education, 2009. ICCSE '09. 4th International Conference on
Conference_Location :
Nanning
Print_ISBN :
978-1-4244-3520-3
Electronic_ISBN :
978-1-4244-3521-0
DOI :
10.1109/ICCSE.2009.5228264