Skip to Main content Skip to Navigation
Conference papers

Formal Verification of Coalescing Graph-Coloring Register Allocation

Abstract : Iterated Register Coalescing (IRC) is a widely used heuristic for performing register allocation via graph coloring. Many implementations in existing compilers follow (more or less faithfully) the imperative algorithm published in 1996. Several mistakes have been found in some of these implementations. In this paper, we present a formal verification (in Coq) of the whole IRC algorithm. We detail a specification that can be used as a reference for IRC. We also define the theory of register-interference graphs; we implement a purely functional version of the IRC algorithm, and we prove the total correctness of our implementation. The automatic extraction of our IRC algorithm into Caml yields a program with competitive performance. This work has been integrated into the CompCert verified compiler.
Document type :
Conference papers
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/inria-00477689
Contributor : Sandrine Blazy <>
Submitted on : Thursday, April 29, 2010 - 8:59:50 PM
Last modification on : Tuesday, June 15, 2021 - 4:15:47 PM
Long-term archiving on: : Monday, October 22, 2012 - 3:32:04 PM

File

2010ESOP.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : inria-00477689, version 1

Citation

Sandrine Blazy, Benoît Robillard, Andrew W. Appel. Formal Verification of Coalescing Graph-Coloring Register Allocation. 19th European Symposium on Programming (ESOP), Mar 2010, Paphos, Cyprus. pp.145-164. ⟨inria-00477689⟩

Share

Metrics

Record views

646

Files downloads

297