Analysis of Graphs by Connectivity Considerations
Journal of the ACM (JACM)
Automatic segmentation of cyclic program structures based on connectivity and processor timing
Communications of the ACM
An efficient search algorithm to find the elementary circuits of a graph
Communications of the ACM
Communications of the ACM
Flow Analysis of Computer Programs
Flow Analysis of Computer Programs
Structure within Locality Intervals
Proceedings of the Third International Symposium on Measuring, Modelling and Evaluating Computer Systems
A graph theoretic approach to the verification of program structures
ICSE '78 Proceedings of the 3rd international conference on Software engineering
Measurement based automatic analysis of FORTRAN programs
AFIPS '69 (Spring) Proceedings of the May 14-16, 1969, spring joint computer conference
Automatic program segmentation based on Boolean connectivity
AFIPS '71 (Spring) Proceedings of the May 18-20, 1971, spring joint computer conference
Segmentation and optimization of programs from cyclic structure analysis
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Evaluation techniques for storage hierarchies
IBM Systems Journal
Characterization of branch and data dependencies on programs for evaluating pipeline performance
IEEE Transactions on Computers
Prediction and trace compression of data access addresses through nested loop recognition
Proceedings of the 6th annual IEEE/ACM international symposium on Code generation and optimization
MediaBench II video: Expediting the next generation of video systems research
Microprocessors & Microsystems
Scalable Communication Trace Compression
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Aligot: cryptographic function identification in obfuscated binary programs
Proceedings of the 2012 ACM conference on Computer and communications security
| Hi-index | 14.98 |
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.