A Case for an Interleaving Constrained Shared Memory
New Research from the University of Michigan duo Jie Yu and Satish Narayanasamy looks into encoding a set of tested correct interleavings in a program’s binary executable using Predecessor Set (PSet) constraints. These constraints are efficiently enforced at runtime using processor support, which ensures that the runtime follows a tested interleaving. They analyze several bugs in open source applications such as MySQL, Apache, Mozilla, etc., and show that, by enforcing PSet constraints, one can avoid not only data races and atomicity violations, but also other forms of concurrency bugs. Source: A Case for Interleaving Constrained Shared Memory Conclusions: Testing and verifying … Continue reading A Case for an Interleaving Constrained Shared Memory