Abstract: The unfolding problem of loop has always been a difficult problem in the partial computation of imperative languages. In this paper, by making use of data flow analysis technique（DFA）, and by introducing a dependency relationship between the variables in a program, an efficient method of unfolding loop for imperative language partial evaluation is presented, and this method can solve the problem very well.