Deadlock Detection in Linear Recursive Programs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Deadlock Detection in Linear Recursive Programs


Deadlock detection in recursive programs that admit dy-namic resource creation is extremely complex and solutions either give imprecise answers or do not scale. We define an algorithm for detecting deadlocks of linear recursive pro-grams of a basic model. The theory that underpins the algorithm is a generalization of the theory of permutations of names to so-called muta-tions, which transform tuples by introducing duplicates and fresh names. Our algorithm realizes the back-end of deadlock analyzers for object-oriented programming languages, once the association programs/basic-model-programs has been defined as front-end.
Fichier principal
Vignette du fichier
sfm-main.pdf (985.22 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01091747 , version 1 (06-12-2014)



Elena Giachino, Cosimo Laneve. Deadlock Detection in Linear Recursive Programs. Formal Methods for Executable Software Models - 14th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, {SFM} 2014, Jun 2014, Bertinoro, Italy. pp.26 - 64, ⟨10.1007/978-3-319-07317-0_2⟩. ⟨hal-01091747⟩


126 View
102 Download



Gmail Facebook X LinkedIn More