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.
No takes yet. Share an insight, caveat, or question.
Paige et al. (1982) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: