Verifying programs under weak memory models (WMMs) is vital due to their prevalence in modern computer architectures. These models introduce complexities, allowing unexpected reordering and visibility of memory operations. Ensuring correctness is crucial to prevent subtle bugs and guarantee the reliability of software running on such systems. However, a memory model specific technique cannot be extended to other memory models. In this work, we strive to develop an automated parameterized verification technique capable of analyzing programs under all possible WMMs.
No takes yet. Share an insight, caveat, or question.
Sharma et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: