Deadlock analysis of unbounded process networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Information and Computation Year : 2017

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 imprecise 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. We show the soundness of the type system, and develop a type inference algorithm for it. The resulting algorithm is able to check deadlock-freedom of programs that cannot be handled by previous analyses, such as those that build unbounded networks.

Dates and versions

hal-01643152 , version 1 (21-11-2017)

Identifiers

Cite

Naoki Kobayashi, Cosimo Laneve. Deadlock analysis of unbounded process networks. Information and Computation, 2017, 252, pp.48 - 70. ⟨10.1016/j.ic.2016.03.004⟩. ⟨hal-01643152⟩
48 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More