Dynamic Characteristics of Loops

1 February 1984

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-33 (2) , 125-132
https://doi.org/10.1109/tc.1984.1676404

Abstract

Loops are directly defined on an instruction execution string rather than on a directed graph model of a program derived from the source code. A simple efficient algorithm to find the loops and subloops thus defined is presented.

Keywords

This publication has 7 references indexed in Scilit:

An empirical study of FORTRAN programs
Software: Practice and Experience, 1971
Segmentation and optimization of programs from cyclic structure analysis
Published by Association for Computing Machinery (ACM) ,1971
Evaluation techniques for storage hierarchies
IBM Systems Journal, 1970
Automatic segmentation of cyclic program structures based on connectivity and processor timing
Communications of the ACM, 1970
Measurement based automatic analysis of FORTRAN programs
Published by Association for Computing Machinery (ACM) ,1969
Object code optimization
Communications of the ACM, 1969
Analysis of Graphs by Connectivity Considerations
Journal of the ACM, 1966