CompCertTSO: A Verified Compiler for Relaxed-Memory Concurrency

Jaroslav Sevcik 1 Viktor Vafeiadis 2 Francesco Zappa Nardelli 3 Suresh Jagannathan 4 Peter Sewell 5
3 Parkas - Parallélisme de Kahn Synchrone
DI-ENS - Département d'informatique de l'École normale supérieure, ENS Paris - École normale supérieure - Paris, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR 8548
Abstract : In this article, we consider the semantic design and verified compilation of a C-like programming language for concurrent shared-memory computation on x86 multiprocessors. The design of such a language is made surprisingly subtle by several factors: the relaxed-memory behavior of the hardware, the effects of compiler optimization on concurrent code, the need to support high-performance concurrent algorithms, and the desire for a reasonably simple programming model. In turn, this complexity makes verified compilation both essential and challenging. We describe ClightTSO, a concurrent extension of CompCert's Clight in which the TSO-based memory model of x86 multiprocessors is exposed for high-performance code, and CompCertTSO, a formally verified compiler from ClightTSO to x86 assembly language, building on CompCert. CompCertTSO is verified in Coq: for any well-behaved and successfully compiled ClightTSO source program, any permitted observable behavior of the generated assembly code (if it does not run out of memory) is also possible in the source semantics. We also describe some verified fence-elimination optimizations, integrated into CompCertTSO.
Type de document :
Article dans une revue
Journal of the ACM (JACM), Association for Computing Machinery, 2013, 60 (3), 22:1-50. 〈10.1145/2487241.2487248〉
Liste complète des métadonnées
Contributeur : Francesco Zappa Nardelli <>
Soumis le : lundi 25 novembre 2013 - 17:12:43
Dernière modification le : mardi 17 avril 2018 - 11:32:38




Jaroslav Sevcik, Viktor Vafeiadis, Francesco Zappa Nardelli, Suresh Jagannathan, Peter Sewell. CompCertTSO: A Verified Compiler for Relaxed-Memory Concurrency. Journal of the ACM (JACM), Association for Computing Machinery, 2013, 60 (3), 22:1-50. 〈10.1145/2487241.2487248〉. 〈hal-00909076〉



Consultations de la notice