Type-Based Deadlock-Freedom Verification for Non-Block-Structured Lock Primitives and Mutable References

  • Authors:
  • Kohei Suenaga

  • Affiliations:
  • Tohoku University,

  • Venue:
  • APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a type-based deadlock-freedom verification for concurrent programs with non-block-structured lock primitives and mutable references. Though those two features are frequently used, they are not dealt with in a sufficient manner by previous verification methods. Our type system uses a novel combination of lock levels, obligations and ownerships . Lock levels are used to guarantee that locks are acquired in a specific order. Obligations and ownerships guarantee that an acquired lock is released exactly once.