A Path-Based Approach to the Detection of Infinite Looping

Authors:
J. Zhang
Affiliations:
-
Venue:
APAQS '01 Proceedings of the Second Asia-Pacific Conference on Quality Software
Year:
2001

Citing 0
Cited 3

Testing closed-source binary device drivers with DDT

USENIXATC'10 Proceedings of the 2010 USENIX conference on USENIX annual technical conference
Counterexamples with loops for predicate abstraction

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Finding relations among linear constraints

AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Infinite looping is a ommon type of program error. Thispaper studies the detection of infinite loops in imperativeprograms. A sufficient condition is given, which is based onprogram paths. For a simple loop, if we can establish theinfeasibility of certain paths within the loop body, we canconclude that the loop does not terminate. Several examplesare given to show the effectiveness of the approach. Its mainbenefits are that it is accurate and it can be supported byautomated tools.