Leslie Lamport

Leslie Lamport is an American computer scientist whose work established key ideas in distributed computing and formal methods, including logical clocks, Paxos, and TLA+.

Distributed computing: A model of computation in which independent processes communicate over a network without shared memory or a global clock. Lamport’s work addresses how such processes coordinate despite delays and failures.
Paxos algorithm: A consensus protocol that lets a distributed set of processes agree on a value despite failures. Lamport’s protocol separates agreement into phases that preserve safety under message delays and crashes.
Barbara Liskov: An American computer scientist known for programming languages, data abstraction, and distributed systems. Liskov and Lamport shared the 2013 Turing Award for foundational contributions to distributed and concurrent systems.
Distributed database: A database whose data is stored across multiple networked computers. Consensus and ordering problems addressed by Lamport arise when replicas coordinate updates.
Happened-before relation: A partial ordering of events that captures causal influence in a distributed system. Lamport introduced this relation to define when one distributed event can affect another.
TLA+: A formal specification language for describing and checking systems as state-transition models. Lamport designed TLA+ to express concurrent algorithms and verify their properties.
Nancy Lynch: An American computer scientist whose research established mathematical foundations for distributed computing. Her work developed alongside Lamport’s in formal models of distributed algorithms.
Replicated state machine: A fault-tolerance technique that runs the same ordered commands on multiple state-machine replicas. Protocols such as Paxos provide the agreed command order needed to keep replicas consistent.
Lamport timestamp: A logical counter assigned to events so causally ordered events receive increasing timestamps. This clock construction turns the happened-before relation into a practical ordering mechanism.
PlusCal: An algorithmic notation that translates into TLA+ specifications for formal analysis. Lamport created PlusCal to make TLA+ models easier to write in an algorithm-like style.

Linked from 2 pages