| ¡¡ | Chinese Journal of Computers Full Text |
| Title | Infinite Loop Detection Based on Path Analysis |
| Authors | RUAN Hui1),2) YAN Jun1) ZHANG Jian1) |
| Address | 1)(State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100190) 2)(Graduate University of Chinese Academy of Sciences, Beijing 100190) |
| Year | 2009 |
| Issue | No.9(1750¡ª1758) |
| Abstract & Background | Abstract This paper proposes a method for detecting infinite loops in C programs. The method is based on some static analysis techniques, including loop unwinding and path feasibility checking. By traversing the program¡¯s flow graph, it firstly generates a set of diagnosis paths for a specified loop. Then it analyzes all the paths according to their test data and relationship, to decide whether there is a subset of the paths matching some non-termination pattern. A prototype tool called LoopAnalyzer is developed to illustrate the feasibility of this method. The experimental results on some benchmark programs show that the tool can detect infinite loops effectively and accurately. Keywords infinite loop; loop unwinding; path feasibility; test data |