A Type System for Unstructured Locking that Guarantees Deadlock Freedom without Imposing a Lock Ordering

Details A Type System for Unstructured Locking that Guarantees Deadlock Freedom without Imposing a Lock Ordering A Type System for Unstructured Locking that Guarantees Deadlock Freedom without Imposing a Lock Ordering

2011-10-19

arxiv.org/abs/1110.4160v1

EPTCS 69, 2011, pp. 44-58

Computer Science

Programming Languages

In Proceedings PLACES 2010, arXiv:1110.3853

Scientific paper

10.4204/EPTCS.69.4

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.

Affiliated with

Also associated with

No associations

Rating

A Type System for Unstructured Locking that Guarantees Deadlock Freedom without Imposing a Lock Ordering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Type System for Unstructured Locking that Guarantees Deadlock Freedom without Imposing a Lock Ordering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Type System for Unstructured Locking that Guarantees Deadlock Freedom without Imposing a Lock Ordering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-596701