Invariants for the Construction of a Handshake Register
暂无分享,去创建一个
Tromp's construction of a waitfree atomic register for one writing process and one reading process is presented and proved by means of ghost variables and invariants. Preservation of the invariants is proved mechanically. This approach can be compared with the original proof based on the partial order on the set of accesses of shared variables.
[1] Robert S. Boyer,et al. A computational logic handbook , 1979, Perspectives in computing.
[2] Maurice Herlihy,et al. Wait-free synchronization , 1991, TOPL.
[3] John Tromp,et al. How to construct an atomic variable , 1989 .
[4] Wim H. Hesselink,et al. The design of a linearization of a concurrent data object , 1998, PROCOMET.