DocumentCode
2340395
Title
A path-based approach to the detection of infinite looping
Author
Zhang, Jian
Author_Institution
Lab. of Comput. Sci., Acad. Sinica, Beijing, China
fYear
2001
fDate
2001
Firstpage
88
Lastpage
94
Abstract
Infinite looping is a common type of program error This paper studies the detection of infinite loops in imperative programs. A sufficient condition is given, which is based on program paths. For a simple loop, if we can establish the infeasibility of certain paths within the loop body, we can conclude that the loop does not terminate. Several examples are given to show the effectiveness of the approach. Its main benefits are that it is accurate and it can be supported by automated tools
Keywords
data flow graphs; program debugging; program verification; imperative programs; infinite looping; program error; program flow graph; program verification; Computer errors; Computer science; Error correction; Flow graphs; Laboratories; Logic; Mathematics; Programming profession; Sufficient conditions; Writing;
fLanguage
English
Publisher
ieee
Conference_Titel
Quality Software, 2001. Proceedings.Second Asia-Pacific Conference on
Conference_Location
Hong Kong
Print_ISBN
0-7695-1287-9
Type
conf
DOI
10.1109/APAQS.2001.990006
Filename
990006
Link To Document