Summary
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.
Similar content being viewed by others
References
MacLane, S., Birkhoff, G.: Algebra. New York: MacMillan 1967
Munkres, J. R.: Elementary linear algebra. Reading (Mass.): Addison-Wesley 1964
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–32
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 1973
Karr, M.: Gathering information about Programs. Massachusetts Computer Associates, Inc., (In preparation)
Birkhoff, G.: Lattice theory. Colloquium Publication XXV, 3. Ed., Providence (R.I.): American Mathematical Society 1973
Author information
Authors and Affiliations
Additional information
This research was supported by the Advanced Research Projects Agency of the Department of Defense and was monitored by U.S. Army Research Office — Durham under Contract No. DAHC04-70-C-0023.
Rights and permissions
About this article
Cite this article
Karr, M. Affine relationships among variables of a program. Acta Informatica 6, 133–151 (1976). https://doi.org/10.1007/BF00268497
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00268497