A Formally Verified Register Allocation Framework
Kent D. Lee · Electronic Notes in Theoretical Computer Science · 2003
When using formal methods to generate compilers it is desirable for all levels of the compiler to be formally specified. Typically, register allocation has been thought to be equivalent to graph coloring. Since graph coloring is NP-Complete most algorithms for register allocation have been ad-hoc. This paper presents a framework for register allocation that has been formally verified using an inductive theorem prover.