Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 576

The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.

Proving Liveness Properties of Concurrent Programs

Open access
Owicki, Susan, Lamport, Leslie·1982·ACM Transactions on Programming Languages and Systems

Abstract

A liveness property asserts that program execution eventually reaches some desirable state.While termination has been studied extensively, many other liveness properties are important for concurrent programs.A formal proof method, based on temporal logic, for deriving liveness properties is presented.It allows a rigorous formulation of simple informal arguments.How to reason with temporal logic and how to use safety (invariance) properties in proving liveness is shown.The method is illustrated using, first, a simple programming language without synchronization primitives, then one with semaphores.However, it is applicable to any programming language.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/357172.357178

Cites

8 of 8 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 8 references

Cited by

See all 576

Metadata

Authors
Owicki, S., & Lamport, L.
Venue
ACM Transactions on Programming Languages and Systems
Published
1982-07
Volume
4
Issue
3
Pages
455-495
ISSN
  • 0164-0925 (ISSN-L)
  • 1558-4593
OpenAlex
W2166656159
Cited by
576
References
8
FWCI
46.40
Type
journal article
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Proving Liveness Properties of Concurrent Programs. https://app.cochat.ai/papers/10.1145/357172.357178
The paper
Owicki, S., & Lamport, L. (1982). Proving Liveness Properties of Concurrent Programs. ACM Transactions on Programming Languages and Systems. https://doi.org/10.1145/357172.357178

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.