Title

Finite Differencing of Computable Expressions

Editor(s)

Graham, Susan L.

Abstract

Finite differencing is a program optimization method that generalizes strength reduction, and provides an efficient implementation for a host of program transformations including "iterator inversion." Finite differencing is formally specified in terms of more basic transformations shown to preserve program semantics. Estimates of the speedup that the technique yields are given. A full illustrative example of algorithm derivation is presented.

Department(s)

Mathematics and Statistics

Keywords and Phrases

program transformation; differentiable expression

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 1982 Association for Computing Machinery (ACM), All rights reserved.


Share

 
COinS