It combines program slicing witch dynamic execution, and can remove the junk codes and opaque predicates easily by applying dynamic slicing on the original codes and recording the status of codes during the executions.
In this paper, the basic concepts of program slicing technique are introduced, and the dynamic program slicing algorithm based on forward analysis and its application to test data generation are presented together.
The program slicing technique is employed in software test data generation so that the efficiency of test data generation can thus be enhanced. In this paper, the basic concepts of program slicing techniques were introduced, and a dynamic program slice algorithm based on forward analysis was presented here,then its application to test data generation was discussed. The result show that the effciency of test data generation can thus be enhanced.
Test data generation is a key for software testing. The program slicing technique is employed in software test data generation so that the efficiency of test data generation can thus be enhanced. In this paper, the basic concepts of program slicing techniques were introduced, and a dynamic program slice algorithm based on forward analysis was presented here,then its application to test data generation was discussed. The result show that the effciency of test data generation can thus be enhanced.
Dynamic program slicing is computed regarding a program′s input, obtained the subset of original program which potentially affect the final results by removing zero or more statements from the original program. Dynamic program slicing is applied to program debugging, program comprehension, software testing and software maintenance. The paper discusses basic concepts in dynamic slicing at first, then presents a dynamic slicing method based-on dynamic flow, it′s application in software test and program debugg...
>=Test data generation is a key for software testing. The program slicing technique is employed in software test data generation so that the efficiency of test data generation can thus be enhanced. By computing program slices of the branch node (or interest node), program input can be adjusted on time and the program can be executed along the specified path. In this paper, the basic concepts of program slicing technique are introduced, and the dynamic program slicing algorithm based on forward analysis and ...