Static Slicing of Threaded Programs

Static program slicing is an established method for analyzing sequential programs, especially for program understanding, debugging and testing. Until now, there was no slicing method for threaded programs which handles interference correctly. We present such a method which also calculates more precise static slices. This paper extends the wellknown structures of the control flow graph and the program dependence graph for threaded programs with interference. This new technique does not require serialization of threaded programs.