Deadlock Analysis of Unbounded Process Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Deadlock Analysis of Unbounded Process Networks

Abstract

Deadlock detection in concurrent programs that create networks with arbitrary numbers of nodes is extremely complex and solutions either give im-precise answers or do not scale. To enable the analysis of such programs, (1) we define an algorithm for detecting deadlocks of a basic model featuring recursion and fresh name generation: the lam programs, and (2) we design a type system for value passing CCS that returns lam programs. As a byproduct of these two tech-niques, we have an algorithm that is more powerful than previous ones and that can be easily integrated in the current release of TyPiCal, a type-based analyser for pi-calculus.
Fichier principal
Vignette du fichier
mfd.pdf (182.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

Elena Giachino, Naoki Kobayashi, Cosimo Laneve. Deadlock Analysis of Unbounded Process Networks. CONCUR 2014 - Concurrency Theory - 25th International Conference, Sep 2014, Rome, Italy. pp.63 - 77, ⟨10.1007/978-3-662-44584-6_6⟩. ⟨hal-01091749⟩

Collections

INRIA INRIA2
75 View
244 Download

Altmetric

Share

Gmail Facebook X LinkedIn More