| Detecting Race Conditions in Parallel Programs that Use Semaphores (2003) | |||||||||||||||||||
Abstract | |||||||||||||||||||
| We address the problem of detecting race conditions in programs that use semaphores for synchronization. Netzer and Miller showed that it is NP-complete to detect race conditions in programs that use many semaphores. We show in this paper that it remains NP-complete even if only two semaphores are used in the parallel programs. For the tractable case,... | |||||||||||||||||||
Details der Publikation | |||||||||||||||||||
| |||||||||||||||||||