Abstract: The present paper deals with a new static slicing algori thm of threaded program based on the program’s control-flow information. The main idea of the algorithm is to retain the control-flow information while the threaded program dependency graph is constructed, with which the threaded realized paths can beidentified, by doing this we can improve the slice’s precision and slicing’s efficiency. An example program and its slice are provided in the end.

Key words: threaded program, program dependency graph, program slicing, slicing algorithm