8 citations · 12 across the 2 of their papers we have counts for
2 papers
cs.PL2011★ 4 cited
A Type System for Unstructured Locking that Guarantees Deadlock Freedom without Imposing a Lock Ordering
Prodromos Gerakios, Nikolaos Papaspyrou, Konstantinos Sagonas
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 freedo…
cs.PL2010★ 8 cited
A Concurrent Language with a Uniform Treatment of Regions and Locks
Prodromos Gerakios, Nikolaos Papaspyrou, Konstantinos Sagonas
A challenge for programming language research is to design and implement multi-threaded low-level languages providing static guarantees for memory safety and freedom from data race…