An important property of concurrent objects is whether they support progress -a special case of liveness-guarantees, which ensure the termination of individual method calls under system fairness assumptions. Liveness properties have been proposed for concurrent objects. Typical liveness properties includelock-freedom,wait-freedom,deadlock-freedom,starvation-freedom and obstruction-freedom. It is known that the five liveness properties above are decidable on the Sequential Consistency (SC) memory model for a bounded number of processes. However, the problem of decidability of liveness for finite state concurrent programs running on relaxed memory models remains open. In this paper we address this problem for the Total Store Order (TSO) memory model,as found in the x86 architecture. We prove that lock-freedom, wait-freedom,deadlock-freedom and starvation-freedom are undecidable on TSO for a bounded number of processes, while obstruction-freedom is decidable.

中文翻译：

---

TSO 内存模型上活性的可判定性

并发对象的一个​​重要属性是它们是否支持进程——一种特殊情况的活性保证，它确保在系统公平假设下终止单个方法调用。已经为并发对象提出了活性属性。典型的活性属性包括无锁、无等待、无死锁、无饥饿和无阻塞。众所周知，对于有限数量的进程，上述五个活性属性可在顺序一致性 (SC) 内存模型上确定。然而，在宽松内存模型上运行的有限状态并发程序的活性可判定性问题仍然存在。在本文中，我们针对 x86 架构中的 Total Store Order (TSO) 内存模型解决了这个问题。我们证明了无锁、无等待、