Affiliation:
1. Uppsala University, Sweden
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.
Publisher
Association for Computing Machinery (ACM)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献