Study of dynamic program slice algorithm of optimizing dependence

Based on the analysis that H.Agrawal´s slicing algorithm produced imprecise result for Circular program, from which a conclusion was drawn that the reason for the imprecision was that the dependence relation of the relied graph was defined too coarsely. Upon which, dynamic program slice algorithm of optimizing dependence was proposed, the connection of the states in a program can be denoted by arrival states, pass through layers by layers, the program structure and the connection of program states can be denoted clearly, improved the accuracy of dynamic program slicing.