3 papers
cs.PL2026
Partial Orders for Precise and Efficient Dynamic Deadlock Prediction
Bas van den Heuvel, Martin Sulzmann, Peter Thiemann
Deadlocks are a major source of bugs in concurrent programs. They are hard to predict, because they may only occur under specific scheduling conditions. Dynamic analysis attempts t…
cs.PL2026
Critical Sections Are Not Per-Thread: A Trace Semantics for Lock-Based Concurrency
Martin Sulzmann
Locks are a standard mechanism for synchronizing concurrent threads. The standard lock set construction assumes that critical sections are confined to a single thread, and therefor…
cs.PL2026
Beyond Per-Thread Lock Sets: Multi-Thread Critical Sections and Dynamic Deadlock Prediction
Martin Sulzmann
Lock sets are commonly used for dynamic analysis of deadlocks. The standard per-thread lock set construction only considers locks acquired in the same thread, but is unaware of loc…