Automatic fine-grain locking using shape properties

Guy Golan-Gueta, Nathan Bronson, Alex Aiken, G. Ramalingam, Mooly Sagiv, Eran Yahav

Research output: Contribution to journalArticlepeer-review


We present a technique for automatically adding fine-grain locking to an abstract data type that is implemented using a dynamic forest -i.e., the data structures may be mutated, even to the point of violating forestness temporarily during the execution of a method of the ADT. Our automatic technique is based on Domination Locking, a novel locking protocol. Domination locking is designed specifically for software concurrency control, and in particular is designed for object-oriented software with destructive pointer updates. Domination locking is a strict generalization of existing locking protocols for dynamically changing graphs. We show our technique can successfully add fine-grain locking to libraries where manually performing locking is extremely challenging. We show that automatic fine-grain locking is more efficient than coarse-grain locking, and obtains similar performance to hand-crafted fine-grain locking..

Original languageEnglish
Pages (from-to)225-241
Number of pages17
JournalACM SIGPLAN Notices
Issue number10
StatePublished - Oct 2011


  • Atomicity
  • Concurrency
  • Locking Protocol
  • Reduction
  • Serializability
  • Synthesis

All Science Journal Classification (ASJC) codes

  • General Computer Science


Dive into the research topics of 'Automatic fine-grain locking using shape properties'. Together they form a unique fingerprint.

Cite this