A Science of Concurrent Programs
Seiten
2026
Cambridge University Press (Verlag)
978-1-009-71985-8 (ISBN)
Cambridge University Press (Verlag)
978-1-009-71985-8 (ISBN)
- Noch nicht erschienen (ca. November 2026)
- Versandkostenfrei
- Auch auf Rechnung
- Artikel merken
Turing Award-winner Leslie Lamport explains how to think more abstractly about concurrent and distributed programs by viewing them mathematically. More abstract thinking leads to better designs, which leads to better code. A fascinating read for graduate students and researchers in theoretical computer science, concurrency, and distributed systems.
Turing Award-winner Leslie Lamport shares the key lessons he has learned about concurrent and distributed computing over decades of writing and reasoning about their algorithms. Algorithms are not programs, and they shouldn't be written in a programming language. Instead, this book explores how to write them and reason about them by using mathematics. It explains the principles underlying abstract programs, which should be implemented to avoid concurrency errors. Designing an abstract program before writing any code can lead to better, more reliable programs. The book has very few mathematical prerequisites, with an appendix summarizing the necessary knowledge. The examples are written in TLA+ and are available online. This is a fascinating read for any graduate students and researchers in theoretical computer science, concurrency, and distributed systems.
Turing Award-winner Leslie Lamport shares the key lessons he has learned about concurrent and distributed computing over decades of writing and reasoning about their algorithms. Algorithms are not programs, and they shouldn't be written in a programming language. Instead, this book explores how to write them and reason about them by using mathematics. It explains the principles underlying abstract programs, which should be implemented to avoid concurrency errors. Designing an abstract program before writing any code can lead to better, more reliable programs. The book has very few mathematical prerequisites, with an appendix summarizing the necessary knowledge. The examples are written in TLA+ and are available online. This is a fascinating read for any graduate students and researchers in theoretical computer science, concurrency, and distributed systems.
Leslie Lamport was Distinguished Scientist at Microsoft Research until his retirement. Dr. Lamport won the 2013 Turing award for 'fundamental contributions to the theory and practice of distributed and concurrent systems.' He is a member of the National Academies of Science and Engineering and the American Association of Arts and Sciences.
About this book; Acknowledgments; 1. Introduction; 2. Ordinary math; 3. Describing abstract programs with math; 4. Safety, liveness, and fairness; 5. Interlude; 6. Refinement; 7. Auxiliary variables; 8. Loose ends; A. Miscellany; B. Proofs; Bibliography; Index.
| Erscheint lt. Verlag | 30.11.2026 |
|---|---|
| Zusatzinfo | Worked examples or Exercises |
| Verlagsort | Cambridge |
| Sprache | englisch |
| Themenwelt | Mathematik / Informatik ► Informatik ► Datenbanken |
| Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge | |
| Mathematik / Informatik ► Informatik ► Theorie / Studium | |
| ISBN-10 | 1-009-71985-8 / 1009719858 |
| ISBN-13 | 978-1-009-71985-8 / 9781009719858 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
