2011/10/19 by Prodromos Gerakios, Nikolaos Papaspyrou, Konstantinos Sagonas
Computer Science · #cs.PL #cs.DC
paper · pdf · doi:10.4204/eptcs.69.4
published as EPTCS 69, 2011, pp. 44-58 · In Proceedings PLACES 2010, arXiv:1110.3853
arxiv created 2011/10/19 · arxiv updated 2011/10/20
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.