Abstract
Guptet 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 Guptaet 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 path-wise automatic generation of test data for both white-box testing and black-box testing.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Weyuker E J. The applicability of program schema results to programs.Int. J. Computer Information Sciences, 1979, 8: 387–403.
Gupta N, Mathur A P, Soffa M L. Automated test data generation using an Iterative Relaxation Method. InProc. ACM SIGSOFT 6th Int. Symp. Foundation of Softw. Eng, Florida, Nov. 3–5, 1998, pp.231–244.
Weiser M. Program slicing.IEEE Trans. Softw. Eng., 1984, SE-10(4): 352–357.
Korel B. Computation of dynamic program slices for unstructured programs.IEEE Trans. Softw. Eng., 1997 23(1): 17–33.
Harrold M J, Rothermel G, Sinha S. Computation of interprocedural control dependence. InProc. the ACM SIGSOFT ISSTA'98, Young M (ed.), Clearwater Beach, Florida, Mar. 2–5, 1998, pp.11–20.
Loeckx J, Sieber K. The Foundations of Program Verification, 2nd Ed., John Wiley & Sons, 1987.
Korel B. Automated software test data generation.IEEE Trans. Softw. Eng. 1990, 16(8): 870–879.
Bischof C, Roh L, M-Oats A. ADIC: An extensible automatic differentiation tool for ANSI-C.Software: Practice and Experience, 1997, 27(12): 1427–1456.
Gupta N, Mathur A P, Soffa M L. UNA-based iterative test data generation and its evaluation. InProc. 14th IEEE Int. Conf. Automated Softw. Eng., Florida, Oct. 12–15, 1999, pp.224–232.
Li B X, Zheng G L, Wang Y F, Li X D. An approach to analyzing and understanding program-program slicing.J. of Computer Research & Development, 2000, 37(3): 284–291. (in Chinese).
Choi J D, Ferrante J. Static slicing in the presence of goto statements.ACM Trans. Programming Language and Systems, 1994, 16(4): 1097–1113.
Harman M, Danicic S. A new algorithm for slicing unstructured programs.J. Softw. Maint., Res. Pract., 1998, 10(6): 415–441.
Shan J H, Wang J, Qi Z C. On path-wise automatic generation of test data for both white-box and black-box testing. InProc. 8th Asia-Pacific Softw. Eng. Conf., APSEC'2001. Macau SAR, China, Dec. 4–7, 2001, pp.237–240.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by the National Natural Science Foundation of China under Grant Nos.69973051, 90104007, 60233020, the National 863 High-Tech Program of China (Grant No. 2001AA113202), and Huo Ying-Dong Education Foundation (Grant No. 71064).
Rights and permissions
About this article
Cite this article
Shan, J., Wang, J., Qi, Z. et al. Improved method to generate path-wise test data. J. Comput. Sci. & Technol. 18, 235–240 (2003). https://doi.org/10.1007/BF02948890
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02948890