skip to main content
research-article
Free access

Turing lecture
The computer science of concurrency: the early years

Published: 21 May 2015 Publication History

Abstract

Leslie Lamport is the recipient of the 2013 ACM A.M. Turing Award.

References

[1]
Alpern, B., Schneider, F.B. Defining liveness. Inform. Process. Lett. 21, 4 (October 1985), 181--185.
[2]
Ashcroft, E.A. Proving assertions about parallel programs. J. Comput. Syst. Sci. 10 (February 1975), 110--135.
[3]
Barros, J.C., Johnson, B.W. Equivalence of the arbiter, the synchronizer, the latch, and the inertial delay. IEEE Trans. Comput. C-32, 7 (July 1983), 603--614.
[4]
Hansen, P.B. Operating System Principles. Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1973.
[5]
Dijkstra, E.W. Solution of a problem in concurrent programming control. Commun. ACM 8, 9 (September 1965), 569.
[6]
Dijkstra, E.W. Cooperating sequential processes. In Programming Languages. F. Genuys, ed. Academic Press, New York, 1968, 43--112. Originally appeared as EWD123 (1965).
[7]
Dijkstra, E.W. Self-stabilizing systems in spite of distributed control. Commun. ACM 17, 11 (November 1974), 643--644.
[8]
Holt, A., Commoner, F. Events and conditions. In Record of the Project MAC Conference on Concurrent Systems and Parallel Computation. Project MAC, June 1970, 3--52.
[9]
Hyman, H. Comments on a problem in concurrent programming control. Commun. ACM 9, 1 (Jan. 1966).
[10]
Knuth, D.E. Additional commments on a problem in concurrent program control. Commun. ACM 9, 5 (May 1966), 321--322.
[11]
Lamport, L. A new solution of Dijkstra's concurrent programming problem. Commun. ACM 17, 8 (August 1974), 453--455.
[12]
Lamport, L. Concurrent reading and writing. Commun. ACM 20, 11 (November 1977), 806--811.
[13]
Lamport, L. Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21, 7 (July 1978), 558--565.
[14]
Lamport, L. A new approach to proving the correctness of multi-process programs. ACM Trans. Program. Lang. Syst. 1, 1 (July 1979), 84--97.
[15]
Lamport, L. The PlusCal algorithm language. In Theoretical Aspects of Computing, ICTAC 2009, Volume 5684 of Lecture Notes in Computer Science. M. Leucker and C. Morgan, eds. Springer-Verlag, 2009, 36--60.
[16]
Milner, R. A Calculus of Communicating Systems, Volume 92 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, N.Y., 1980.
[17]
Minkowski, H. Space and time. In The Principle of Relativity. Dover, 1952, 73--91.
[18]
Petri, C.A. Fundamentals of a theory of asynchronous information flow. In Information Processing 1962, Proceedings of IFIP Congress 62. C.M. Popplewell, ed. North-Holland, 1962, 386--390.
[19]
Pnueli, A. The temporal logic of programs. In Proceedings of the 18th Annual Symposium on the Foundations of Computer Science. IEEE, November 1977, 46--57.
[20]
Randell, B., Lee, P.A., Treleaven, P.C. Reliability issues in computing system design. Comput. Surv. 10, 2 (June 1978), 123--165.
[21]
Rudolph, B.A. Self-assessment procedure xxi. Commun. ACM 33, 5 (May 1990), 563--575.

Cited By

View all

Index Terms

  1. Turing lecture

    The computer science of concurrency: the early years

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image Communications of the ACM
      Communications of the ACM  Volume 58, Issue 6
      June 2015
      94 pages
      ISSN:0001-0782
      EISSN:1557-7317
      DOI:10.1145/2783419
      • Editor:
      • Moshe Y. Vardi
      Issue’s Table of Contents
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 21 May 2015
      Published in CACM Volume 58, Issue 6

      Permissions

      Request permissions for this article.

      Check for updates

      Qualifiers

      • Research-article
      • Popular
      • Refereed

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)503
      • Downloads (Last 6 weeks)50
      Reflects downloads up to 18 Jan 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2024)On Distributed Computing: A View, Physical Versus Logical Objects, and a Look at Fully Anonymous SystemsStabilization, Safety, and Security of Distributed Systems10.1007/978-3-031-74498-3_1(3-19)Online publication date: 20-Oct-2024
      • (2023)Verificación de Programas ParalelosRevista Abierta de Informática Aplicada10.59471/raia2023577:1(51-77)Online publication date: 22-Sep-2023
      • (2023)LiteratureCloud Computing10.1016/B978-0-32-385277-7.00023-3(597-620)Online publication date: 2023
      • (2023)Concurrency and cloud computingCloud Computing10.1016/B978-0-32-385277-7.00017-8(349-409)Online publication date: 2023
      • (2023)From Monitors to Monitors: A Primitive HistoryMinds and Machines10.1007/s11023-023-09632-234:S1(51-71)Online publication date: 5-Apr-2023
      • (2022)Improving scalability of Earth system models through coarse-grained component concurrency – a case study with the ICON v2.6.5 modelling systemGeoscientific Model Development10.5194/gmd-15-9157-202215:24(9157-9176)Online publication date: 21-Dec-2022
      • (2022)SCM-IoT: An Aproach for Internet of Things Services Integration and CoordinationApplied Sciences10.3390/app1206313312:6(3133)Online publication date: 18-Mar-2022
      • (2022)A visit to mutual exclusion in seven datesTheoretical Computer Science10.1016/j.tcs.2022.03.030919(47-65)Online publication date: Jun-2022
      • (2022)From Interface Automata to HypercontractsPrinciples of Systems Design10.1007/978-3-031-22337-2_23(477-493)Online publication date: 29-Dec-2022
      • (2021)From Stories to Concurrency: How Children Can Play with Formal MethodsFormal Methods – Fun for Everybody10.1007/978-3-030-71374-4_10(191-207)Online publication date: 11-Mar-2021
      • Show More Cited By

      View Options

      View options

      PDF

      View or Download as a PDF file.

      PDFChinese translation

      eReader

      View online with eReader.

      eReader

      Digital Edition

      View this article in digital edition.

      Digital Edition

      Magazine Site

      View this article on the magazine site (external)

      Magazine Site

      Login options

      Full Access

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media