A New Approach to Proving the Correctness of Multiprocess Programs

DOI10.1145/357062.357068zbMath0463.68022OpenAlexW2040068897MaRDI QIDQ3914410

Leslie Lamport

Publication date: 1979

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/357062.357068

zbMATH Keywords

mutual exclusionprogram correctnessconcurrent processingmultiprocessing

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Related Items (9)

On interprocess communication. I: Basic formalism ⋮ Mutual exclusion as a matter of priority ⋮ Self-stabilizing timestamps ⋮ Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos ⋮ The butterfly barrier ⋮ Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority ⋮ Parallel algorithms for the single source shortest path problem ⋮ Shared-memory mutual exclusion: major research trends since 1986 ⋮ Logical classification of distributed algorithms (Bakery algorithms as an example)

This page was built for publication: A New Approach to Proving the Correctness of Multiprocess Programs