Computational Dependence and the Termination of Simple Loops in Computer Programs,
Abstract
A brief review is given of the current state of the art in program analysis, both practical and theoretical. A description is given of desirable features for an analysis system. An algorithm is described which detects whether a simple loop has a number n of repetitions such that the loop will terminate after n or fewer repetitions or will never terminate, when this can be determined from the dependence of variables one on another in the loop computation without using information about the specific functions used. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 15, 1970
- Accession Number
- AD0732295
Entities
People
- Stephen M. Taylor
Organizations
- University of Illinois Urbana–Champaign