Hi, there, I am now a Ph.D. student and working on the resilience analysis of programs. We are now trying to profile the resilience properties of loops in a program. The most important problem for us to be solved is to find the loop depth in a loop tree. In other words, we would like to know how many loops are nested in a certain loop and how many loops are out of it. How can I build/generate this kind of loop tree? Any hints or responses would be appreciated. And that would be best if there are any examples. Thank you so much. Hailong Jiang
