Optimized Branch and Bound for Path-wise Test Data Generation

  • Ya-Wen Wang (1) State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications, Beijing, China 10 Xitucheng Road, Beijing, China
  • Ying Xing
  • Yun-Zhan Gong (1) State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications, Beijing, China 10 Xitucheng Road, Beijing, China
  • Xu-Zhou Zhang (1) State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications, Beijing, China 10 Xitucheng Road, Beijing, China

Abstract

The increasing complexity of real-world programs necessitates the automationof software testing. As a basic problem in software testing, the automationof path-wise test data generation is especially important, which is in essence a constraintsatisfaction problem solved by search strategies. In this paper, the searchalgorithm branch and bound is introduced and optimized to tackle the problem ofpath-wise test data generation. The optimized branching operation is fulfilled by adynamic variable ordering algorithm with a heuristic rule to break ties. The optimizedbounding operation is accomplished by analyzing the results of interval arithmetic.In order to facilitate the search methods, the solution space is represented as statespace. Experimental results prove the effectiveness of the optimized branching andbounding operations, and show that the proposed method outperformed some othermethods used in test data generation. The results also demonstrate that the proposedmethod is applicable in engineering.

Author Biography

Ya-Wen Wang, (1) State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications, Beijing, China 10 Xitucheng Road, Beijing, China
Department of Mathematics and Computer Science

References

[1] Michael R. Lyu; Sampath Rangarajan; Ada P. A. van Moorse. (2002); Optimal allocation of test resources for software reliability growth modeling in software development, IEEE Transactions on Reliability, ISSN 1841-9836, 51(2): 183-192.

[2] Tassey Gregory.(2002);The economic impacts of inadequate infrastructure for software testing, National Institute of Standards and Technology, RTI Project 7007.011.

[3] Weyuker Elaine J.(1999); Evaluation techniques for improving the quality of very large software systems in a cost-effective way, Journal of Systems and Software, ISSN 0164-1212, 47(2): 97-103.

[4] Shaukat Ali, Lionel C. Briand; Hadi Hemmati; Rajwinder K. Panesar-Walawege. (2010); A systematic review of the application and empirical investigation of search-based test case generation, IEEE Transactions on Software Engineering, ISSN 0098-5589, 36(6): 742-762.

[5] Mao Chengying; Yu Xinxin; Chen Jifu.(2012); Swarm Intelligence-Based Test Data Generation for Structural Testing, Proceedings of 11th International Conference on Computer and Information Science (ICIS 12),623-628.

[6] Suzette Person; Guowei Yang; Neha Rungta; Sarfraz Khurshid. (2012); Directed incremental symbolic execution, IACM SIGPLAN Notices, ISSN 0362-1340, 46(6): 504-515.

[7] Moore Ramon Edgar; R. Baker Kearfott; Michael J. Cloud.(2009);Introduction to interval analysis, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA.

[8] Richard A. DeMillo; A. Jefferson Offutt. (1991); Constraint-based automatic test data generation, IEEE Transactions on Software Engineering, ISSN 0098-5589, 17(9): 900-910.

[9] Arnaud Gotlieb; Bernard Botella; Michel Rueher.(1998);Automatic test data generation using constraint solving techniques, Proceedings of the 1998 ACM SIGSOFT International Symposium on Software Testing and Analysis, 23(2):53-62.

[10] Cristian Cadar; Daniel Dunbar; Dawson Engler.(2008);KLEE: Unassisted and automatic generation of high-coverage tests for complex systems programs, Proceedings of USENIX Symposium on Operating Systems Design and Implementation (OSDI 2008), 209-224.

[11] Wang Yawen; Gong Yunzhan; Xiao Qing. (2013); A Method of Test Case Generation Based on Necessary Interval Set, Journal of Computer-Aided Design & Computer Graphics, ISSN 1003-9775, 25(4): 550-556.

[12] A.E. Eiben; Zs Ruttkay.(1997);Constraint satisfaction problems, pp. C5.7:1-8, New York, NY, USA: IOP Publishing Ltd and Oxford University Press.

[13] Ling-Ling Wang; Wen-Hsiang Tsai. (1988); Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search, BIT Numerical Mathematics, ISSN 0003-3835, 28(1): 54-68.

[14] Lianbo Gao; Shashi K. Mishra; Jianming Shi. (2012); An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem, Optimization Letters, ISSN 1862-4472, 6(2): 221-230.

[15] Ying Xing; Junfei Huang; Yunzhan Gong; Yawen Wang; Xuzhou Zhang. (2014); An Intelligent Method Based on State Space Search for Automatic Test Case Generation, Journal of Software, ISSN 1796-217X, 9(2): 358-364.

[16] Ying Xing; Junfei Huang; Yunzhan Gong; Yawen Wang; Xuzhou Zhang. (2014); Path-wise Test Data Generation Based on Heuristic Look-ahead Methods, Mathematical Problems in Engineering, ISSN 1024-123X,volume 2014, Article ID 642630.

[17] Matthew J Gallagher; V. Lakshmi Narasimhan. (2012); Adtest: A test data generation suite for Ada software systems, IEEE Transactions on Software Engineering, ISSN 0098- 5589, 23(8): 473-484.

[18] Mao Chengying; Yu Xinxin; Chen Jifu.(2012); Generating Test case for Structural Testing Based on Ant Colony Optimization, Proceedings of the 12th International Conference on Quality Software (QSIC12), 98-101.

[19] Ammann Paul; Jeff Offutt.(2008); Introduction to Software Testing, Cambridge University Press, New York, NY, USA.

[20] E. Alba; F. Chicano. (2008); Observation in Using Parallel and Sequential Evolutionary Algorithms for Automatic Software Testing, Computers & Operators Research, ISSN 0305- 0548, 35(10): 3161-3183.
Published
2014-06-15
How to Cite
WANG, Ya-Wen et al. Optimized Branch and Bound for Path-wise Test Data Generation. INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, [S.l.], v. 9, n. 4, p. 497-509, june 2014. ISSN 1841-9844. Available at: <http://univagora.ro/jour/index.php/ijccc/article/view/1169>. Date accessed: 11 aug. 2020. doi: https://doi.org/10.15837/ijccc.2014.4.1169.

Keywords

test data generation, constraint satisfaction problem, branch and bound, state space search