A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf
.
A Scalable, Sound, Eventually-Complete Algorithm for Deadlock Immunity
[chapter]
2008
Lecture Notes in Computer Science
We introduce the concept of deadlock immunity-a program's ability to avoid all deadlocks that match patterns of deadlocks experienced in the past. We present here an algorithm for enabling large software systems to automatically acquire such immunity without any programmer assistance. We prove that the algorithm is sound and complete with respect to the immunity property. We implemented the algorithm as a tool for Java programs, and measurements show it introduces only modest performance
doi:10.1007/978-3-540-89247-2_8
fatcat:4s5wwk2utjaudk2hdzrbr2o2nm