论文信息 - Separation and Reduction - 字舞流文

Separation and Reduction

We present some new theorems that equate an iteration to a sequential composition of stronger iterations, and use these theorems to simplify and generalize a number of known techniques for pretending atomicity in concurrent programs.

Ernie Cohen | Ernie Cohen

[1] Mohamed G. Gouda,et al. Protocol Validation by Maximal Progress State Exploration , 1984, IEEE Trans. Commun..

[2] Simon L. Peyton Jones,et al. Imperative functional programming , 1993, POPL '93.

[3] Christos H. Papadimitriou,et al. The Theory of Database Concurrency Control , 1986 .

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

[5] Ralph-Johan Back. A Method for Refining Atomicity in Parallel Algorithms , 1989, PARLE.

[6] Ralph-Johan Back,et al. Reasoning algebraically about loops , 1999, Acta Informatica.

[7] Leslie Lamport,et al. Pretending Atomicity , 1989 .

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