By Topic

A path-based approach to the detection of infinite looping

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)
Jian Zhang ; Lab. of Comput. Sci., Acad. Sinica, Beijing, China

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

Published in:

Quality Software, 2001. Proceedings.Second Asia-Pacific Conference on

Date of Conference:

2001