Many algorithms for analyzing parallel programs, example to detect deadlocks or data races calculate the execution cost, are based on a model variously known as cost graph, computation graph dependency which captures structure of threads in program. In modern graphs highly dynamic and depend greatly program inputs details. As such, most analyses that use these either specialized static gather s...