The pursuit of deadlock freedom

DOI10.1016/0890-5401(87)90004-6zbMATH Open0626.68019OpenAlexW2123401374MaRDI QIDQ580970FDOQ580970

Authors: 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

Recommendations

• Deadlock analysis in networks of communicating processes
• scientific article; zbMATH DE number 3926230
• Verification, Model Checking, and Abstract Interpretation
• Tighter reachability criteria for deadlock-freedom analysis
• Deadlock-freedom in resource contentions

zbMATH Keywords

concurrent systemslocal analysis of networksloop termination

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Verifying properties of parallel programs
• A Theory of Communicating Sequential Processes
• A Proof System for Communicating Sequential Processes
• Deadlock absence proofs for networks of communicating processes
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (24)

• Discovering and correcting a deadlock in a channel implementation
• Translating between models of concurrency
• Reducing complex CSP models to traces via priority
• Title not available (Why is that?)
• Title not available (Why is that?)
• Using partial orders for the efficient verification of deadlock freedom and safety properties
• Proof pearl: a formal proof of Dally and Seitz' necessary and sufficient condition for deadlock-free routing in interconnection networks
• Wait-freedom with advice
• Wait-freedom with advice
• A trace-based service semantics guaranteeing deadlock freedom
• Deadlock checking by a behavioral effect system for lock handling
• Deadlock-freeness of hexagonal systolic arrays
• Static deadlock prevention in dynamically configured communication networks
• A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems
• Verifying deadlock-freedom of communication fabrics
• Title not available (Why is that?)
• Deadlock free specification based on local process properties
• Deadlock analysis in networks of communicating processes
• Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving
• Component-Based Construction of Deadlock-Free Systems
• Deadlock-freedom in resource contentions
• A deadlock free and starvation free network of packet switching communication processors
• A formal proof of a necessary and sufficient condition for deadlock-free adaptive networks
• A generalized deadlock predicate

This page was built for publication: The pursuit of deadlock freedom

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580970)