Sciweavers

Share
PLDI
2010
ACM

Bringing Extensibility to Verified Compilers

9 years 2 months ago
Bringing Extensibility to Verified Compilers
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proof assistant. This technique provides a strong, end-to-end correctness guarantee on top of a small trusted computing base. Unfortunately, these compilers are also challenging to extend since each additional transformation must be proven correct in full formal detail. At the other end of the spectrum, techniques for compiler correctness based on a domain-specific language for writing optimizations, such as Lerner's Rhodium and Cobalt, make the compiler easy to extend: the correctness of additional transformations can be checked completely automatically. Unfortunately, these systems provide a weaker guarantee since their end-to-end correctness has not been proven fully formally. We present an approach for compiler correctness that provides the best of both worlds by bridging the gap between compiler verific...
Zachary Tatlock, Sorin Lerner
Added 09 Aug 2010
Updated 09 Aug 2010
Type Conference
Year 2010
Where PLDI
Authors Zachary Tatlock, Sorin Lerner
Comments (0)
books