Research On Dependence Analysis And Software Testing

Dependence analysis and program slicing are the technology of program decomposing; they have been used in many areas of software engineering. The large scale and the complexity of today`s software engineering make it very hard to design and test, and the software testing always account for more than half of our cost, so, enhancing the efficiency of software testing will reduce our cost and accelerate the cycle of our software development. Because of the large scale of software systems, the right method should be suit to the ongoing practice, and focus on particular some hotspots; this makes dependence analysis have important meaning in the process of software testing. The balance between efficiency and effect is the aim both in practice and theory in the area of software testing. Dependence analysis and program slicing are the most important technology of program decomposing, and bring our software testing with intent and aims if we apply them to our software testing, under special condition and special requirement with effect, dependence analysis and program slicing will increase efficiency of software testing remarkably.Based on the ability of dependence analysis in the software testing area, this paper do some research as following:In automatic test data generation, one of the most difficult problems in static analysis is the ambiguity of program variable. In some papers, this problem is called array problem or pointer problem. This paper attempts to analysis the problem formally, proves the space that satisfies constraint of path of uncertain state can be compartmentalized many sub-spaces that satisfy the same constraint, so this problem can be avoided when test data is searched only in a sub-space. This paper presents an algorithm to implement this search that is only in a sub-space through technology of program slicing.Slicing is a well-known reduction technique. Most of the research on slicing is code-based. There has been limited research on specification-based slicing and model-based slicing. EFSM is a very important specification model, but a practical EFSM model is often large and complex and is hard to understand and modify. EFSM-based slicing is very useful to test and analysis EFSM models. The dependence analysis based EFSM dependence graph is much more than a graph reachability problem, so that traverse algorithms based marking visited nodes cannot to be used in EFSM dependence graphs. In this paper, we discuss dependence analysis in EFSMs, and define a dependence transform function and a reverse dependence transfer...