Fast Slicing of Concurrent Programs

Debugging complex concurrent programs is a very difficult problem. Slicing techniques can simplify debugging and understanding these programs. However, slicing of concurrent program is compute-intensive asthe required intermediate graph often becomes large. In this context, we generalize the structure of the intermediate graph representation of concurrent programs and this leads us to introduce the notion of Concurrent Control Flow Graph (CCFG). We introduce a parallel algorithm to compute static slices of concurrent programs using CCFG.