Name
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/BF02948890 | J. Comput. Sci. Technol. |
Keywords | Field | DocType |
iterative relaxation method,path-wise test data generator,data-flow anal- ysis,test data,software testing,dynamic data dependency,predicate function,automated test data generation,black-box testing,improved method,static slice,program slice.,predicate slice,constructional algorithm,white-box testing,program path,program slicing,modeling language,test data generation,black box testing,data flow,dynamic data | Program slicing,Computer science,Correctness,Relaxation (iterative method),Algorithm,Data-flow analysis,Equivalence (measure theory),Dynamic data,Test data,Test data generation | Journal |
Volume | Issue | ISSN |
18 | 2 | 1860-4749 |
Citations | PageRank | References |
8 | 0.83 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jin-Hui Shan | 1 | 44 | 3.14 |
| Ji Wang | 2 | 39 | 6.62 |
| ZhiChang Qi | 3 | 159 | 19.62 |
| JianPing Wu | 4 | 8 | 0.83 |