Type Inference for Deadlock Detection in a Multithreaded Polymorphic Typed Assembly Language

Details Type Inference for Deadlock Detection in a Multithreaded Polymorphic Typed Assembly Language Type Inference for Deadlock Detection in a Multithreaded Polymorphic Typed Assembly Language

2010-02-04

arxiv.org/abs/1002.0942v2

EPTCS 17, 2010, pp. 95-109

Computer Science

Programming Languages

Scientific paper

10.4204/EPTCS.17.8

We previously developed a polymorphic type system and a type checker for a multithreaded lock-based polymorphic typed assembly language (MIL) that ensures that well-typed programs do not encounter race conditions. This paper extends such work by taking into consideration deadlocks. The extended type system verifies that locks are acquired in the proper order. Towards this end we require a language with annotations that specify the locking order. Rather than asking the programmer (or the compiler's backend) to specifically annotate each newly introduced lock, we present an algorithm to infer the annotations. The result is a type checker whose input language is non-decorated as before, but that further checks that programs are exempt from deadlocks.

Affiliated with

Also associated with

No associations

Rating

Type Inference for Deadlock Detection in a Multithreaded Polymorphic Typed Assembly Language 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 Type Inference for Deadlock Detection in a Multithreaded Polymorphic Typed Assembly Language, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Type Inference for Deadlock Detection in a Multithreaded Polymorphic Typed Assembly Language will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-154729