Publication details

Saarland University Computer Science

On Correctness of Buffer Implementations in a Concurrent Lambda Calculus with Futures

Jan Schwinghammer, David Sabel, Joachim Niehren, Manfred Schmidt-Schauß

Technical Report, Research group for Artificial Intelligence and Software Technology, Goethe Universitt Frankfurt, Germany, 2009

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.

Download PDF        Show BibTeX               

Login to edit

Legal notice, Privacy policy