The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Specifying Concurrent Program Modules
Open accessAbstract
Concurrent Program ModulesA method for specifying program modules in a concurrent program is described.It is based upon temporal logic, but uses new kinds of temporal assertions to make the specifications simpler and easier to understand.The semantics of the specifications is described informally, and a sequence of examples are given culminating in a specification of three modules comprising the alternating-bit communication protocol.A formal semantics is given in the appendix.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
The temporal logic of programs
Pnueli, A. (1977) · 18th Annual Symposium on Foundations of Computer Science (sfcs 1977) · doi:10.1109/sfcs.1977.32 · Cited by 5,689
Proving Liveness Properties of Concurrent Programs
Owicki, S., & Lamport, L. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357178 · Cited by 576
Self-citation"Sometime" is sometimes "not never"
Lamport, L. (1980) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/567446.567463 · Cited by 360
Self-citation
Cited by
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
Linearizability: a correctness condition for concurrent objects
Herlihy, M. P., & Wing, J. M. (1990) · ACM Transactions on Programming Languages and Systems · doi:10.1145/78969.78972 · Cited by 3,176
Lamport, L. (1994) · ACM Transactions on Programming Languages and Systems · doi:10.1145/177492.177726 · Cited by 1,843
Self-citationSpecifying real-time properties with metric temporal logic
Koymans, R. (1990) · Real-Time Systems · doi:10.1007/bf01995674 · Cited by 1,180
Simple, fast, and practical non-blocking and blocking concurrent queue algorithms
Michael, M. M., & Scott, M. L. (1996) · Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 · doi:10.1145/248052.248106 · Cited by 802
Metadata
- Authors
- Lamport, L.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 1983-04
- Volume
- 5
- Issue
- 2
- Pages
- 190-222
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W2086070079
- Cited by
- 524
- References
- 4
- FWCI
- 16.32
- 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
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.