A lightweight deadlock analysis for programs with threads and reentrant locks - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Science of Computer Programming Année : 2019

A lightweight deadlock analysis for programs with threads and reentrant locks

Résumé

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 synchronizations 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). In fact, the technique is intended to be an effective tool for the deadlock analysis of programming languages by defining ad-hoc extraction processes. We demonstrate this effectivity by applying our analysis to a core calculus featuring shared objects, threads and Java-like synchronization primitives. We also discuss a prototype verifier, called JaDA, that covers several features of Java and deliver initial assessments of the tool.
Fichier principal
Vignette du fichier
1-s2.0-S0167642318303812-main.pdf (516.37 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02392938 , version 1 (04-12-2019)

Identifiants

Citer

Cosimo Laneve. A lightweight deadlock analysis for programs with threads and reentrant locks. Science of Computer Programming, 2019, 181, pp.64 - 81. ⟨10.1016/j.scico.2019.06.002⟩. ⟨hal-02392938⟩
27 Consultations
232 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More