Deadlock analysis of unbounded process networks

详细信息    查看全文

• 作者：Naoki Kobayashi^a ; ^{koba@is.s.u-tokyo.ac.jp} ; Cosimo Laneve^b ; ^c ; ^{cosimo.laneve@unibo.it}
• 关键词：Deadlocks ; Process calculi ; Type systems ; Behavioural types ; Lam programs ; Fixpoints
• 刊名：Information and Computation
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：252
• 期：Complete
• 页码：48-70
• 全文大小：616 K
• 卷排序：252

文摘

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.