What is decidable under the TSO memory model?
Mohamed Faouzi Atig · ACM SIGLOG News · 2020
We consider the verification problem of safety and liveness properties of finite-state programs running under the Total Store Ordering (TSO) memory model.We first review the decidability/complexity results regarding these two problems and then show that the termination problem is decidable.