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

  • PD Pearce
  • RJ Hicks
Computer Algebra Systems Implementation II
Part of the Lecture Notes in Computer Science book series (LNCS, volume 204)


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.


  1. Hicks R J 1984 PhD Thesis. The Optimisation of User Programs for the REDUCE Algebraic Manipulation System by Pre-Processing. Kingston Polytechnic, England.Google Scholar
  2. Pearce D Hicks R J 1981 The Optimisation of User Programs for an Algebraic Manipulation System. Proceedings of ACM Symposium on Symbolic and Algebraic Computation, Snowbird, Utah, p 131–136.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • PD Pearce
    • 1
  • RJ Hicks
    • 2
  1. 1.School of Information Systems DesignKingston PolytechnicEngland
  2. 2.Department of Applied ScienceNorth East Surrey College of TechnologyEngland

Personalised recommendations