Improved method to generate path-wise test data

  • Authors:

  • JinHui Shan;Ji Wang;ZhiChang Qi;JianPing Wu

  • Affiliations:

  • School of Computer, National University of Defense Technology, Changsha 410073, P.R. China;School of Computer, National University of Defense Technology, Changsha 410073, P.R. China;School of Computer, National University of Defense Technology, Changsha 410073, P.R. China;School of Computer, National University of Defense Technology, Changsha 410073, P.R. China

  • Venue:
  • Journal of Computer Science and Technology
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Gupta et al., proposed a method, which is referred to as the Iterative Relaxation Method, to generate test data for a given path in a program by linearizing the predicate functions. In this paper, a model language is presented and the properties of static and dynamic data dependencies are investigated. The notions in the Iterative Relaxation Method are defined formally. The predicate slice proposed by Gupta et al. is extended to path-wise static slice. The correctness of the constructional algorithm is proved afterward. The improvement shows that the constructions of predicate slice and input dependency set can be omitted. The equivalence of systems of constraints generated by both methods is proved. The prototype of path-wise test data generator is presented in this paper. The experiments show that our method is practical, and fits the pathwise automatic generation of test data for both white-box testing and black-box testing.