Deadlock analysis of unbounded process networks

DOI10.1016/j.ic.2016.03.004zbMath1355.68193OpenAlexW2294770514MaRDI QIDQ729810

Naoki Kobayashi, Cosimo Laneve

Publication date: 22 December 2016

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2016.03.004

zbMATH Keywords

type systemsprocess calculideadlocksbehavioural typesfixpointslam programs

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Comparing type systems for deadlock freedom ⋮ A lightweight deadlock analysis for programs with threads and reentrant locks ⋮ Prioritise the best variation

Uses Software

• TyPiCal

Cites Work

• Unnamed Item
• Deadlock checking by data race detection
• Conversation types
• A calculus of communicating systems
• A calculus of mobile processes. II
• A type system for lock-free processes
• Type-based information flow analysis for the \(\pi\)-calculus
• Deadlock Analysis of Unbounded Process Networks
• Deadlock and lock freedom in the linear π-calculus
• Deadlock Detection in Linear Recursive Programs
• A New Type System for Deadlock-Free Processes
• Formal Methods at the Crossroads. From Panacea to Foundational Support

This page was built for publication: Deadlock analysis of unbounded process networks