Correctness of an STM Haskell implementation

Abstract

A concurrent implementation of software transactional memory in Concurrent Haskell using a call-by-need functional language with processes and futures is given. The description of the small-step operational semantics is precise and explicit, and employs an early abort of conflicting transactions. A proof of correctness of the implementation is given for a… (More)
DOI: 10.1145/2500365.2500585

Topics

6 Figures and Tables

Slides referencing similar topics