A New Approach to Proving the Correctness of Multiprocess Programs-Reference-Cited by-同舟云学术

A New Approach to Proving the Correctness of Multiprocess Programs

Published:1979-01 Issue:1 Volume:1 Page:84-97
ISSN:0164-0925
Container-title:ACM Transactions on Programming Languages and Systems
language:en
Short-container-title:ACM Trans. Program. Lang. Syst.

Author:

Lamport Leslie¹

Affiliation:

1. SRI International, 333 Ravenswood Avenue, 415 Menlo Park, CA

Abstract

A new, nonassertional approach to proving multiprocess program correctness is described by proving the correctness of a new algorithm to solve the mutual exclusion problem. The algorithm is an improved version of the bakery algorithm. It is specified and proved correct without being decomposed into indivisible, atomic operations. This allows two different implementations for a conventional, nondistributed system. Moreover, the approach provides a sufficiently general specification of the algorithm to allow nontrivial implementations for a distributed system as well.

Publisher

Association for Computing Machinery (ACM)

Subject

Software

Link

https://dl.acm.org/doi/pdf/10.1145/357062.357068

Reference7 articles.

1. A language for formal problem specification

2. Formal verification of parallel programs

3. A new solution of Dijkstra's concurrent programming problem

4. Time, clocks, and the ordering of events in a distributed system

Cited by 49 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Origin of Self-Stabilization;Edsger Wybe Dijkstra;2022-07-12

2. Bounded Verification of Multi-threaded Programs via Lazy Sequentialization;ACM Transactions on Programming Languages and Systems;2022-03-31

3. Locks;Nonsequential and Distributed Programming with Go;2021

4. Voting–Priority-Based Deadlock Prevention in Multi-server Multi-CS Distributed Systems;National Academy Science Letters;2020-02-20

5. An Effective Voting and Priority Based Technique for Deadlock Prevention in Distributed & Cloud Systems;SSRN Electronic Journal;2019