Compositional Deadlock Detection for Rendezvous Communication

Download Now Date Added: Oct 2009
Format: PDF

Concurrent programming languages are growing in importance with the advent of multi-core systems. However, concurrent programs suffer from problems, such as data races and deadlock, absent from sequential programs. Unfortunately, traditional race and deadlock detection techniques fail on both large programs and small programs with complex behaviors. In this paper, the authors present a compositional deadlock detection technique for a concurrent language - SHIM - in which tasks run asynchronously and communicate using synchronous CSP-style rendezvous.