The pursuit of deadlock freedom

DOI10.1016/0890-5401(87)90004-6zbMath0626.68019OpenAlexW2123401374MaRDI QIDQ580970

A. W. Roscoe, Naiem Dathi

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0890-5401(87)90004-6

zbMATH Keywords

concurrent systemslocal analysis of networksloop termination

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items

Deadlock analysis in networks of communicating processes, Translating between models of concurrency, Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving, Deadlock checking by a behavioral effect system for lock handling, Reducing complex CSP models to traces via priority, Deadlock-freeness of hexagonal systolic arrays, Discovering and correcting a deadlock in a channel implementation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deadlock absence proofs for networks of communicating processes
• A Theory of Communicating Sequential Processes
• A Proof System for Communicating Sequential Processes
• Verifying properties of parallel programs