Abstract
Since flow of control within a program introduces a level of uncertainty, many of the studies cited have dealt only with straight line programs. This article studies register allocation for straight line programs in the context of a set of graph games. It is shown that several variants of the register allocation problem for straight line programs are polynomial complete.
| Original language | English (US) |
|---|---|
| Pages | 182-195 |
| Number of pages | 14 |
| State | Published - 1973 |
| Event | ACM Symp on Theory of Comput, 5th Annu, Proc, Conf Rec, Pap - Austin, Tex Duration: Apr 30 1973 → May 2 1973 |
Other
| Other | ACM Symp on Theory of Comput, 5th Annu, Proc, Conf Rec, Pap |
|---|---|
| City | Austin, Tex |
| Period | 4/30/73 → 5/2/73 |
ASJC Scopus subject areas
- General Engineering