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. As a byproduct of these two techniques, 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. © 2014 Springer-Verlag.
Cite
CITATION STYLE
Giachino, E., Kobayashi, N., & Laneve, C. (2014). Deadlock analysis of unbounded process networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704 LNCS, pp. 63–77). Springer Verlag. https://doi.org/10.1007/978-3-662-44584-6_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
