Turing lectureThe computer science of concurrency

  title={Turing lectureThe computer science of concurrency},
  author={Leslie Lamport},
  journal={Communications of the ACM},
  pages={71 - 76}
  • L. Lamport
  • Published 21 May 2015
  • Physics
  • Communications of the ACM
Leslie Lamport is the recipient of the 2013 ACM A.M. Turing Award. 
6 Citations

Figures from this paper

Concurrency in the Cloud
Symmetric Tokens based Group Mutual Exclusion
A First-Come-First-Served (FCFS) GME algorithm that only uses atomic read/write operations for n threads is proposed, which settles the open problem posed in 2001.
A Complete Bibliography of Publications in Communications of the ACM : 2020–2029
A* [11]. Above [53]. abuse [120]. accelerators [157]. access [120]. accessibility [133]. achieve [21]. ACM [103, 74, 96, 99]. Across [45, 84]. adapting [96]. Adding [64]. address [151]. adoption
SCM-IoT: An Aproach for Internet of Things Services Integration and Coordination
This paper proposes an SOA model, called SCM-IoT (service composition model for IoT), for incorporating AI into IoT systems, addressing their coordination by a mediator offering services for storage, production, discovery, and notification of relevant data for client applications.


Solution of a problem in concurrent programming control
A number of mainly independent sequential-cyclic processes with restricted means of communication with each other can be made in such a way that at any moment one and only one of them is engaged in
A New Approach to Proving the Correctness of Multiprocess Programs
A new, nonassertional approach to proving multiprocess program correctness is described by proving the correctness of a new algorithm to solve the mutual exclusion problem. The algorithm is an
Additional comments on a problem in concurrent programming control
Professor Dijkstra's ingenious construction and Hyman's "simplification" for the case of two computers hardly works at all, and it is hoped that this letter can save people some of the problems they would encounter if they were to use either of those methods.
A Calculus of Communicating Systems
  • R. Milner
  • Computer Science
    Lecture Notes in Computer Science
  • 1980
A case study in synchronization and proof techniques, and some proofs about data structures in value-communication as a model of CCS 2.0.
The PlusCal Algorithm Language
PlusCal is an algorithm language that can be used right now to replace pseudo-code, for both sequential and concurrent algorithms, based on the TLA + specification language, and a PlusCal algorithm is automatically translated to a T LA + specification that is checked with the TLC model checker and reasoned about formally.
Defining Liveness
Proving Assertions about Parallel Programs
Concurrent reading and writing
Two general theorems are proved, and some algorithms are presented to illustrate their use, including a solution to the general problem in which a read is repeated if it might have obtained an incorrect result, and two techniques for transmitting messages between processes.
Equivalence of the Arbiter, the Synchronizer, the Latch, and the Inertial Delay
An axiomatic method for proving correctness properties about digital circuit implementations under the influence of asynchronous inputs is presented, and the axioms describe ideal behavior of the four most commonly studied asynchronous circuits.
Time, clocks, and the ordering of events in a distributed system
A distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events, and a bound is derived on how far out of synchrony the clocks can become.