论文信息 - On interprocess communication

On interprocess communication

A formalism for specifying and reasoning about concurrent systems is described. Unlike more conventional formalisms, it is not based upon atomic actions. A definition of what it means for one system to implement a higher-level system is given and justified. In Part II, the formalism is used to specify several classes of interprocess communication mechanisms and to prove the correctness of algorithms for implementing them.

Leslie Lamport | L. Lamport | Leslie Lamport

[1] Philip A. Bernstein,et al. Concurrency Control in Distributed Database Systems , 1986, CSUR.

[2] Leslie Lamport. A New Approach to Proving the Correctness of Multiprocess Programs , 1979, TOPL.

[3] Leslie Lamport,et al. Interprocess Communication , 2020, Practical System Programming with C.

[4] Glynn Winskel,et al. Events in computation , 1980 .

[5] Jayadev Misra. Axioms for memory access in asynchronous hardware systems , 1986, TOPL.

[6] Gary L. Peterson,et al. Concurrent Reading While Writing , 1983, TOPL.

[7] Leslie Lamport,et al. Concurrent reading and writing , 1977, Commun. ACM.

[8] Wilfried Brauer,et al. Net Theory and Applications , 1980, Lecture Notes in Computer Science.

[9] Leslie Lamport. What it means for a concurrent program to satisfy a specification: why no one has specified priority , 1985, POPL '85.

[10] Fred Kröger,et al. Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[11] Robin Milner,et al. A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[12] David Lorge Parnas,et al. Concurrent control with “readers” and “writers” , 1971, CACM.

[13] Leslie Lamport,et al. Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[14] Antoni W. Mazurkiewicz. Semantics of concurrent systems: a modular fixed-point trace approach , 1984, European Workshop on Applications and Theory in Petri Nets.