Deadlock Analysis of Unbounded Process Networks

Elena Giachino 1, 2 Naoki Kobayashi 3 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 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.
Type de document :
Communication dans un congrès
CONCUR 2014 - Concurrency Theory - 25th International Conference, Sep 2014, Rome, Italy. pp.63 - 77, 2014, 〈10.1007/978-3-662-44584-6_6〉
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01091749
Contributeur : Laneve Cosimo <>
Soumis le : samedi 6 décembre 2014 - 09:18:14
Dernière modification le : samedi 27 janvier 2018 - 01:30:54
Document(s) archivé(s) le : lundi 9 mars 2015 - 06:06:58

Fichier

mfd.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

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, 2014, 〈10.1007/978-3-662-44584-6_6〉. 〈hal-01091749〉

Partager

Métriques

Consultations de la notice

121

Téléchargements de fichiers

117