A lightweight deadlock analysis for programs with threads and reentrant locks - Archive ouverte HAL Access content directly
Conference Papers Year :

A lightweight deadlock analysis for programs with threads and reentrant locks

(1, 2)
1
2

Abstract

Deadlock analysis of multi-threaded programs with reentrant locks is complex because these programs may have infinitely many states. We define a simple calculus featuring recursion, threads and synchroniza-tions that guarantee exclusive access to objects. We detect deadlocks by associating an abstract model to programs-the extended lam model-and we define an algorithm for verifying that a problematic object dependency (e.g. a circularity) between threads will not be manifested. The analysis is lightweight because the deadlock detection problem is fully reduced to the corresponding one in lams (without using other models). The technique is intended to be an effective tool for the deadlock analysis of programming languages by defining ad-hoc extraction processes.
Fichier principal
Vignette du fichier
FM2018-Laneve.pdf (394.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01926509 , version 1 (19-11-2018)

Identifiers

  • HAL Id : hal-01926509 , version 1

Cite

Cosimo Laneve. A lightweight deadlock analysis for programs with threads and reentrant locks. 22nd International Symposium on Formal Methods, Jul 2018, Oxford, United Kingdom. ⟨hal-01926509⟩
55 View
186 Download

Share

Gmail Facebook Twitter LinkedIn More