Rusty Variation: Deadlock-free Sessions with Failure in Rust

Deadlock-Free Parallel Processing

Deadlock-free Connguration Programming

The connguration programming approach has been successfully applied to model parallel and distributed systems in terms of their component processes and relationships, separated from the functional aspects of the components' behaviour. This approach promotes the construction of modular and exible systems but the lack of information about the components' behaviour prevents us verifying important ...

Deadlock-free Multicast Wormhole Routing in Multicomputer Networks Deadlock-free Multicast Wormhole Routing in Multicomputer Networks

EEcient routing of messages is the key to the performance of multicomputers. Mul-ticast communication refers to the delivery of the same message from a source node to an arbitrary number of destination nodes. Wormhole routing is the most promising switching technique used in new generation multicomputers. In this paper, we present multicast wormhole routing methods for multicomputers adopting 2...

Deadlock-Free Monitors: Extended Version

Monitors constitute one of the common techniques to synchronize threads in multithreaded programs, where calling a wait command on a condition variable suspends the caller thread and notifying a condition variable causes the threads waiting for that condition variable to resume their execution. One potential problem with these programs is that a waiting thread might be suspended forever leading...

Deadlock-Free Channels and Locks

The combination of message passing and locking to protect shared state is a useful concurrency pattern. However, programs that employ this pattern are susceptible to deadlock. That is, the execution may reach a state where each thread in a set waits for another thread in that set to release a lock or send a message. This paper proposes a modular verification technique that prevents deadlocks in...