Task interaction graphs for concurrency analysis
Douglas L. Long, Lori A. Clarke · 1989
A representation for concurrent programs, called task inter-action graphs, is presented. Task interaction graphs divide a program into maximal sequential regions connected by edges rep-resenting task interactions. This representation is illustrated and it is shown how it can be used to create concurrency graph rep-resentations that are much smaller than those created from con-trol flow graph representations. Both task interaction graphs and their corresponding concurrency graphs facilitate analysis of concurrent programs. Some analyses and optimizations on these representations are also described. 1