Countable nondeterminism and random assignment
Open accessThe DOI matches its Crossref record.
Abstract
Four semantics for a small programming language involving unbounded (but countable) nondeterminism are provided. These comprise an operational semantics, two state transformation semantics based on the Egli-Milner and Smyth orders, respectively, and a weakest precondition semantics. Their equivalence is proved. A Hoare-like proof system for total correctness is also introduced and its soundness and completeness in an appropriate sense are shown. Finally, the recursion theoretic complexity of the notions introduced is studied. Admission of countable nondeterminism results in a lack of continuity of various semantic functions, and this is shown to be necessary for any semantics satisfying appropriate conditions. In proofs of total correctness, one resorts to the use of (countable) ordinals, and it is shown that all recursive ordinals are needed.
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
Cited by
Abstract Interpretation Frameworks
COUSOT, P., & COUSOT, R. (1992) · Journal of Logic and Computation · doi:10.1093/logcom/2.4.511 · Cited by 710
“Whence the concrete domain P needs not to be a cpo (and it is not for the Smyth order [2]).”
BackgroundThe origins of structural operational semantics
Plotkin, G. D. (2004) · The Journal of Logic and Algebraic Programming · doi:10.1016/j.jlap.2004.03.009 · Cited by 362
Self-citation
Metadata
- Authors
- Apt, K. R., & Plotkin, G. D.
- Venue
- Journal of the ACM
- Published
- 1986-08-10
- Volume
- 33
- Issue
- 4
- Pages
- 724-767
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2014552079
- Cited by
- 181
- References
- 0
- FWCI
- 7.27
- 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: Countable nondeterminism and random assignment. https://app.cochat.ai/papers/10.1145/6490.6494
- The paper
- Apt, K. R., & Plotkin, G. D. (1986). Countable nondeterminism and random assignment. Journal of the ACM. https://doi.org/10.1145/6490.6494
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.