Relaxed-memory concurrency and verified compilation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Relaxed-memory concurrency and verified compilation

Abstract

In this paper, we consider the semantic design and verified compilation of a C-like programming language for concurrent shared-memory computation above x86 multiprocessors. The design of such a language is made surprisingly subtle by several factors: the relaxed-memory behaviour of the hardware, the effects of compiler optimisation 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 (or verifying) compilation both essential and challenging. We define a concurrent relaxed-memory semantics for ClightTSO, an extension of CompCert's Clight in which the processor's memory model is exposed for high-performance code. We discuss a strategy for verifying compilation from ClightTSO to x86, which we validate with correctness proofs (building on CompCert) for the most interesting compiler phases.
No file

Dates and versions

hal-00907801 , version 1 (21-11-2013)

Identifiers

  • HAL Id : hal-00907801 , version 1

Cite

Jaroslav Sevcik, Viktor Vafeiadis, Francesco Zappa Nardelli, Suresh Jagannathan, Peter Sewell. Relaxed-memory concurrency and verified compilation. POPL - 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, Jan 2011, Austin, TX, United States. ⟨hal-00907801⟩

Relations

77 View
0 Download

Share

Gmail Facebook X LinkedIn More