Deadlock analysis of unbounded process networks

  title={Deadlock analysis of unbounded process networks},
  author={Naoki Kobayashi and Cosimo Laneve},
  journal={Inf. Comput.},
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. As a byproduct of these two techniques, we have an algorithm that… CONTINUE READING