Several optimizations of programs can be performed when in certain regions of a program equality relationships hold between a linear combination of the variables of the program and a constant. This paper presents a practical approach to detecting these relationships by considering the problem from the viewpoint of linear algebra. Key to the practicality of this approach is an algorithm for the calculation of the “sum” of linear subspaces.
Unable to display preview. Download preview PDF.
- 1.MacLane, S., Birkhoff, G.: Algebra. New York: MacMillan 1967Google Scholar
- 2.Munkres, J. R.: Elementary linear algebra. Reading (Mass.): Addison-Wesley 1964Google Scholar
- 3.Floyd, R.: Assigning meanings to programs. In: Schwartz, J. (ed.): Mathematical aspects of computer science 19. Providence (R.I.): American Mathematical Society 1967, p. 19–32Google Scholar
- 4.Wegbreit, Ben: Property extraction in well-Founded property sets. Center for Research in Computing Technology, Harvard University, Cambridge (Mass.) and Computer Science Division, Bolt, Beranek, and Newman, Inc., Cambridge (Mass.), February 1973Google Scholar
- 5.Karr, M.: Gathering information about Programs. Massachusetts Computer Associates, Inc., (In preparation)Google Scholar
- 6.Birkhoff, G.: Lattice theory. Colloquium Publication XXV, 3. Ed., Providence (R.I.): American Mathematical Society 1973Google Scholar