A New Solution of Dijkstra's Concurrent Programming Problem

Lamport, L. (1974). A New Solution of Dijkstra's Concurrent Programming Problem. Communications of the ACM, 453-455.

Type

Journal article

Intellectual base

Primary research

Year

1974

DOI

10.1145/361082.361093

Link

https://doi.org/10.1145/361082.361093

Cited from

computer_science

Cited by

1 citation across 1 artifact.

Primes

• Mutual Exclusion
  • Although the canonical vocabulary (critical region, lock, semaphore) is computing-flavoured, the at-most-one signature is structurally pure: the same shape governs a single-track railway, a surgical sterile field, an exclusive licence, and a cell-cycle checkpoint, with only the naming carrying any institutional residue.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:85b2d22ecb5f · see in the full table