Optimization of range checking

Authors:
Victoria Markstein;Peter Markstein;John Cocke
Affiliations:
in silico Labs, Woodside, CA;Hewlett-Packard Laboratories, Palo Alto, CA;IBM Thomas J. Watson Research Center, Yorktown Heights, New York
Venue:
ACM SIGPLAN Notices - Best of PLDI 1979-1999
Year:
2004

Citing 5
Cited 0

A fresh look at optimizing array bound checking

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Optimizing array bound checks using flow analysis

ACM Letters on Programming Languages and Systems (LOPLAS)
A program data flow analysis procedure

Communications of the ACM
The 801 minicomputer

ASPLOS I Proceedings of the first international symposium on Architectural support for programming languages and operating systems
An overview of the PL.8 compiler

SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction

Quantified Score

Hi-index	0.00

Visualization

Abstract

An analysis is given for optimizing run-time range checks in regions of high execution frequency. These optimizations are accomplished using strength reduction, code motion and common subexpression elimination. Test programs, using the above optimizations, are used to illustrate run-time improvements.