Development of the value numbering method

Authors:
A. N. Filippov
Affiliations:
MCST, Moscow, Russia 105066
Venue:
Programming and Computing Software
Year:
2010

Citing 3
Cited 0

Points-to analysis in almost linear time

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Advanced compiler design and implementation

Advanced compiler design and implementation
Value-driven redundancy elimination

Value-driven redundancy elimination

Quantified Score

Hi-index	0.00

Visualization

Abstract

A possible way to accelerate the execution of a program is to optimize it at compilation time. Some optimizing transformations use additional information obtained by a preliminary analysis of the program. The paper is devoted to the popular method of the analysis of the intermediate program representation called the value numbering method. Several techniques improving the classical algorithm are proposed and the effect the proposed improvements on the execution time of certain programs is analyzed.