论文信息 - Pretending Atomicity

Pretending Atomicity

We present a theorem for deriving properties of a concurrent program by reasoning about a simpler, coarser-grained version. The theorem generalizes a result that Lipton proved for partial correctness and deadlock-freedom. Our theorem applies to all safety properties.

Leslie Lamport | Fred B. Schneider

[1] Richard J. Lipton,et al. Reduction: a method of proving properties of parallel programs , 1975, CACM.

[2] Bowen Alpern,et al. Defining Liveness , 1984, Inf. Process. Lett..

[3] Thomas W. Doeppner,et al. Parallel program correctness through refinement , 1977, POPL.

[4] Leslie Lamport,et al. Constraints: a uniform approach to aliasing and typing , 1985, POPL.

[5] Leslie Lamport,et al. The ``Hoare Logic'' of CSP, and All That , 1984, TOPL.

[6] Edward A. Ashcroft,et al. Proving Assertions about Parallel Programs , 1975, J. Comput. Syst. Sci..

[7] Leslie Lamport,et al. Proving the Correctness of Multiprocess Programs , 1977, IEEE Transactions on Software Engineering.