Deadlock Detection in Linear Recursive Programs

Elena Giachino 1, 2 Cosimo Laneve 1, 2
1 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal.inria.fr/hal-01091747
Contributor : Laneve Cosimo <>
Submitted on : Saturday, December 6, 2014 - 9:11:45 AM
Last modification on : Saturday, January 27, 2018 - 1:31:24 AM
Long-term archiving on : Monday, March 9, 2015 - 6:06:51 AM

File

sfm-main.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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, 2014, Jun 2014, Bertinoro, Italy. pp.26 - 64, ⟨10.1007/978-3-319-07317-0_2⟩. ⟨hal-01091747⟩

Share

Metrics

Record views

210

Files downloads

175