Deadlock Checking by Data Race Detection - Fundamentals of Software Engineering Access content directly
Conference Papers Year : 2013

Deadlock Checking by Data Race Detection

Ka I Pun
  • Function : Author
  • PersonId : 1007025
Martin Steffen
  • Function : Author
  • PersonId : 880464


Deadlocks are a common problem in programs with lock-based concurrency and are hard to avoid or even to detect. One way for deadlock prevention is to statically analyze the program code to spot sources of potential deadlocks.We reduce the problem of deadlock checking to race checking, another prominent concurrency-related error for which good (static) checking tools exist. The transformation uses a type and effect-based static analysis, which analyzes the data flow in connection with lock handling to find out control-points that are potentially part of a deadlock. These control-points are instrumented appropriately with additional shared variables, i.e., race variables injected for the purpose of the race analysis. To avoid overly many false positives for deadlock cycles of length longer than two, the instrumentation is refined by adding “gate locks”. The type and effect system and the transformation are formally given. We prove our analysis sound using a simple, concurrent calculus with re-entrant locks.
Fichier principal
Vignette du fichier
978-3-642-40213-5_3_Chapter.pdf (191.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01514663 , version 1 (26-04-2017)





Ka I Pun, Martin Steffen, Volker Stolz. Deadlock Checking by Data Race Detection. 5th International Conference on Fundamentals of Software Engineering (FSEN), Apr 2013, Tehran, Iran. pp.34-50, ⟨10.1007/978-3-642-40213-5_3⟩. ⟨hal-01514663⟩
121 View
75 Download



Gmail Facebook X LinkedIn More