Deadlock analysis of unbounded process networks

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 recu...

Full description

Bibliographic Details

Published in:	Information and computation Vol. 252; pp. 48 - 70
Main Authors:	Kobayashi, Naoki, Laneve, Cosimo
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.02.2017 Elsevier
Subjects:	Behavioural types Computation and Language Computer Science Deadlocks Fixpoints Lam programs Process calculi Programming Languages Type systems Fixpoints Behavioural types Lam programs Type systems Deadlocks Process calculi
ISSN:	0890-5401, 1090-2651
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!