The optimisation by "code motion" of user programs for an algebraic manipulation system

Abstract

If there are space problems when executing a program then both the above optimisations can assist in enabling the program to run to completion. Code motion not involving loops, that does not alter the binding of variables, when combined with dead variable elimination, can alter the minimum store in which programs can be executed. Also the number of garbage collection calls may decrease, giving a time saving. ROPT is a useful tool to perform these tedious optimisations.

Further work will investigate optimisation using the methods described above and using the run time characteristics of a program. The methods also need to be applied to a wider class of REDUCE programs.