Probabilistic Concurrency Testing for Weak Memory Programs
Mingyu Gao, Soham Sundar Chakraborty, Burcu Kulahcioglu Ozkan · 2023
The Probabilistic Concurrency Testing (PCT) algorithm that provides theoretical guarantees on the probability of detecting concurrency bugs does not apply to weak memory programs. The PCT algorithm builds on the interleaving semantics of sequential consistency, which does not hold for weak memory concurrency. It is because weak memory concurrency allows additional behaviors that cannot be produced by any interleaving execution.