Recommendations
Cites work
- scientific article; zbMATH DE number 3902016 (Why is no real title available?)
- scientific article; zbMATH DE number 3926230 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 3711387 (Why is no real title available?)
- A Proof System for Communicating Sequential Processes
- A Theory of Communicating Sequential Processes
- Deadlock absence proofs for networks of communicating processes
- Verifying properties of parallel programs
Cited in
(28)- Discovering and correcting a deadlock in a channel implementation
- Checking deadlock-freedom of parametric component-based systems
- Translating between models of concurrency
- Checking deadlock-freedom of parametric component-based systems
- Reducing complex CSP models to traces via priority
- scientific article; zbMATH DE number 3926230 (Why is no real title available?)
- scientific article; zbMATH DE number 176516 (Why is no real title available?)
- 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
- Deadlock analysis of unbounded process 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
- Tighter reachability criteria for deadlock-freedom analysis
- Static deadlock prevention in dynamically configured communication networks
- A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems
- Verifying deadlock-freedom of communication fabrics
- scientific article; zbMATH DE number 3862446 (Why is no real title available?)
- 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
- Deadlock-freedom in resource contentions
- A deadlock free and starvation free network of packet switching communication processors
- Component-Based Construction of Deadlock-Free Systems
- A generalized deadlock predicate
- A formal proof of a necessary and sufficient condition for deadlock-free adaptive networks
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)
