ACM Transactions on Programming Languages and Systems · 1982 · 283 citations · 20 references
ComputingComputer ScienceMathematicsAlgorithmsProgramming LanguagesTheory Of ComputationDifference EquationsFinite Difference MethodsComputable NumbersDifference ComputationDifferencing
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.
20
An axiomatic basis for computer programming
C. A. R. Hoare · Communications of the ACM · 1969 · 3.9K citations · Full text
A Transformation System for Developing Recursive Programs
R. M. Burstall, John Darlington · Journal of the ACM · 1977 · 1.3K citations · Full text
Proceedings of the 27th International Conference on Very Large Data Bases
Peter M. G. Apers, Paolo Atzeni, Stefano Ceri et al. · 2001 · 845 citations
A Unified Approach to Path Problems
Robert E. Tarjan · Journal of the ACM · 1981 · 251 citations · Full text