Correctly Translating Concurrency Primitives

Abstract : Motivated by the question of correctness of a specific implementation of concurrent buffers in the lambda calculus with futures underlying Alice ML, we prove that concurrent buffers and handled futures can correctly encode each other. Correctness means that our encodings preserve and reflect the observations of may- and must-convergence. This also shows correctness wrt. program semantics, since the encodings are adequate translations wrt. contextual semantics. While these translations encode blocking into queuing and waiting, we also provide an adequate encoding of buffers in a calculus without handles, which is more low-level and uses busy-waiting instead of blocking. Furthermore we demonstrate that our correctness concept applies to the whole compilation process from high-level to low-level concurrent languages, by translating the calculus with buffers, handled futures and data constructors into a small core language without those constructs.
Document type :
Conference papers
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/inria-00429239
Contributor : Joachim Niehren <>
Submitted on : Saturday, February 5, 2011 - 12:38:47 PM
Last modification on : Thursday, February 21, 2019 - 10:52:49 AM
Long-term archiving on: Tuesday, November 6, 2012 - 1:31:10 PM

File

0.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00429239, version 1

Collections

Citation

Jan Schwinghammer, David Sabel, Manfred Schmidt-Schauss, Joachim Niehren. Correctly Translating Concurrency Primitives. The 2009 SIGPLAN Workshop on ML, Oct 2009, Edinburgh, United Kingdom. pp.27-38. ⟨inria-00429239⟩

Share

Metrics

Record views

405

Files downloads

329