Correctness of an STM Haskell implementation

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 contextual semantics with may- and should-convergence. This implies that our implementation is a correct evaluator for an abstract specification equipped with a big-step semantics.

Metadaten
Author:	Manfred Schmidt-Schauß ORCiD GND, David Sabel ORCiD GND
URN:	urn:nbn:de:hebis:30:3-344403
URL:	http://www.ki.informatik.uni-frankfurt.de/papers/frank/frank50v2.pdf
Parent Title (English):	Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik ;
Series (Serial Number):	Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik (50 [v.2])
Publisher:	Johann Wolfgang Goethe-Univ., Fachbereich Informatik und Mathematik, Inst. für Informatik
Place of publication:	Frankfurt am Main
Document Type:	Working Paper
Language:	English
Date of Publication (online):	2013/03/27
Date of first Publication:	2013/03/27
Publishing Institution:	Universitätsbibliothek Johann Christian Senckenberg
Release Date:	2014/07/08
Issue:	Version: 27 März 2013
Page Number:	20
Last Page:	20
HeBIS-PPN:	344379841
Institutes:	Informatik und Mathematik / Informatik
Dewey Decimal Classification:	0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Sammlungen:	Universitätspublikationen
Licence (German):	Deutsches Urheberrecht

Open Access