The following pages link to The pursuit of deadlock freedom (Q580970):
Displaying 16 items.
- Proof pearl: a formal proof of Dally and Seitz' necessary and sufficient condition for deadlock-free routing in interconnection networks (Q437040) (← links)
- Deadlock checking by a behavioral effect system for lock handling (Q444480) (← links)
- Deadlock-freeness of hexagonal systolic arrays (Q765473) (← links)
- Deadlock-freedom in resource contentions (Q801672) (← links)
- A generalized deadlock predicate (Q1085972) (← links)
- A deadlock free and starvation free network of packet switching communication processors (Q1116325) (← links)
- Reducing complex CSP models to traces via priority (Q1744391) (← links)
- Using partial orders for the efficient verification of deadlock freedom and safety properties (Q1801499) (← links)
- Checking deadlock-freedom of parametric component-based systems (Q1996857) (← links)
- Translating between models of concurrency (Q2182666) (← links)
- Discovering and correcting a deadlock in a channel implementation (Q2322306) (← links)
- Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving (Q2418047) (← links)
- A trace-based service semantics guaranteeing deadlock freedom (Q2428498) (← links)
- Deadlock analysis in networks of communicating processes (Q2638755) (← links)
- Wait-freedom with advice (Q5891976) (← links)
- Wait-freedom with advice (Q5918242) (← links)