The Research On Software Testing Based On Program Slicing

Software testing is a important measure to find, correct, and prevent the errors of software, also to improve software's functions. The aim of software testing is to find errors in program. The process of software testing makes use of test data to find software's errors. With the size of software augmenting, the status of software testing is more and more important.The program slicing technique is a kind of technique used to analyses and understands a program, which possesses the characteristics of problem simplification and target localization. So it is widely applied in many areas such as software maintenance, debugging, testing and code comprehension etc. Software testing techniques based on program slicing is a kind of testing that based on program or program with requirement. Program slicing can reduce the size of software testing, and the testing efficiency is improved. With these characteristics, program slicing also include diversified dependent relations (for example: data dependence and control dependence), these dependent relations enhance the veracity of software testing.Now, for the problem of feasible path selection in structure test, traditional methods of infeasible path elimination have much restriction, and the effect is not excellent. So the active idea of feasible path selection can effectively reduce infeasible paths. The dissertation systematically expatiates upon the program slicing technique and studies various research efforts. Based on the existing feasible path algorithms, the dissertation introduces program slicing technique and presents a novel algorithm of feasible path selection. Through using program slicing technique, it analyzes the characteristic of program's structure in the process of feasible path selection. It can express predicate covered, namely the path to the appointed point. Program slicing technique can clearly show the feasible path covering the structure of program, so it is only concerned about the statements in feasible path for each statement or each block.The dissertation presents a new concept---paths slicing, it absorbs the idea of program slicing. The kind of slicing is regarded as a set of paths. The blindness of feasible paths selection is reduced.