Interference Graphs of Programs in SSA-form

Abstract Register allocation is the task of mapping the variables in a program to processor registers. This problem is often reduced to coloring the so-called interference graph which the compiler computes from the input program. Theoretically, for each undirected graph there is a program having that graph as its interference graph. In this paper, we show that interference graphs of programs in SSA-form are chordal.