Abstract

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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call