Validating Register Allocation and Spilling

Abstract. Following the translation validation approach to highassurance compilation, we describe a new algorithm for validating a posteriori the results of a run of register allocation. The algorithm is based on backward dataflow inference of equations between variables, registers and stack locations, and can cope with sophisticated forms of spilling and live range splitting, as well as many architectural irregularities such as overlapping registers. The soundness of the algorithm was mechanically proved using the Coq proof assistant.

• Type: Conference
• Year: 2010
• Where: CC
• Authors: Silvain Rideau, Xavier Leroy
• Keywords: Algorithm, Backward Dataflow Inference, CC 2010, Programming Languages, Translation Validation Approach