A Type System for Unstructured Locking that Guarantees Deadlock Freedom without Imposing a Lock Ordering
Programming Languages
2011-10-20 v1 Distributed, Parallel, and Cluster Computing
Abstract
Deadlocks occur in concurrent programs as a consequence of cyclic resource acquisition between threads. In this paper we present a novel type system that guarantees deadlock freedom for a language with references, unstructured locking primitives, and locks which are implicitly associated with references. The proposed type system does not impose a strict lock acquisition order and thus increases programming language expressiveness.
Cite
@article{arxiv.1110.4160,
title = {A Type System for Unstructured Locking that Guarantees Deadlock Freedom without Imposing a Lock Ordering},
author = {Prodromos Gerakios and Nikolaos Papaspyrou and Konstantinos Sagonas},
journal= {arXiv preprint arXiv:1110.4160},
year = {2011}
}
Comments
In Proceedings PLACES 2010, arXiv:1110.3853