Journal Article

[HG:2006:RA]

Sebastian Hack, Gerhard Goos, Optimal register allocation for SSA-form programs in polynomial time, Information Processing Letters 98(4), p. 150--155, May 2006.

Abstract

This paper gives a constructive proof that the register allocation problem for a uniform register set is solvable in polynomial time for SSA-form programs.

Authors

Department Head Prof. Gerhard Goos

Alumni Prof. Sebastian Hack