The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Tentative steps toward a development method for interfering programs
Open accessAbstract
Development methods for (sequential) programs that run in isolation have been studied elsewhere.Programs that run in parallel can interfere with each other, either via shared storage or by sending messages.Extensions to earlier development methods are proposed for the rigorous development of interfering programs.In particular, extensions to the specification method based on postconditions that are predicates of two states and the development methods of operation decomposition and data refinement are proposed.
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
Dijkstra, E. W. (1976) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,733
A Calculus of Communicating Systems
(1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10235-3 · Cited by 4,633
An axiomatic basis for computer programming
Hoare, C. A. R. (1969) · Communications of the ACM · doi:10.1145/363235.363259 · Cited by 4,002
Monitors: an operating system structuring concept
Hoare, C. A. R. (1974) · Communications of the ACM · doi:10.1145/355620.361161 · Cited by 1,496
Proof of correctness of data representations
Hoare, C. A. R. (1972) · Acta Informatica · doi:10.1007/bf00289507 · Cited by 966
Program development by stepwise refinement
Wirth, N. (1971) · Communications of the ACM · doi:10.1145/362575.362577 · Cited by 960
Program development by stepwise refinement
Wirth, N. (1983) · Communications of the ACM · doi:10.1145/357980.358010 · Cited by 688
Plotkin, G. D. (1976) · SIAM Journal on Computing · doi:10.1137/0205035 · Cited by 649
An algebraic definition of simulation between programs
Milner, R. (1971) · Defense Technical Information Center (DTIC) · Cited by 538
Software Development: A Rigorous Approach
Jones, C. B. (1980) · CERN Document Server (European Organization for Nuclear Research) · doi:10.25405/ncl.34123362 · Cited by 424
Self-citationProof of algorithms by general snapshots
Naur, P. (1966) · BIT Numerical Mathematics · doi:10.1007/bf01966091 · Cited by 217
Hoare, C. A. R. (1971) · Communications of the ACM · doi:10.1145/362452.362489 · Cited by 180
Hoare, C. A. R. (1978) · Springer eBooks · doi:10.1007/978-1-4612-6315-9_10 · Cited by 156
Proof of Algorithms by General Snapshots
Naur, P. (1993) · Studies in cognitive systems · doi:10.1007/978-94-011-1793-7_3 · Cited by 144
Properties of Programs and the First-Order Predicate Calculus
Manna, Z. (1969) · Journal of the ACM · doi:10.1145/321510.321516 · Cited by 82
A proof method for cyclic programs
Francez, N., & Pnueli, A. (1978) · Acta Informatica · doi:10.1007/bf00289074 · Cited by 64
Cited by
(2006) · Technical Report Series 936 · doi:10.2471/trs.02.935 · Cited by 1,096
Systems of Systems Engineering: Basic Concepts, Model-Based Techniques, and Research Directions
Nielsen, C. B., Larsen, P. G., Fitzgerald, J., Woodcock, J., & Peleska, J. (2015) · ACM Computing Surveys · doi:10.1145/2794381 · Cited by 454
Jhala, R., & Majumdar, R. (2009) · ACM Computing Surveys · doi:10.1145/1592434.1592438 · Cited by 418
A Survey of Research into Mixed Criticality Systems
Burns, A., & Davis, R. I. (2018) · ACM Computing Surveys · doi:10.1145/3131347 · Cited by 282
Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning
Jung, R., Swasey, D., Sieczkowski, F., Svendsen, K., Turon, A., Birkedal, L., & Dreyer, D. (2015) · Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages · doi:10.1145/2676726.2676980 · Cited by 276
Metadata
- Authors
- Jones, C. B.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 1983-10
- Volume
- 5
- Issue
- 4
- Pages
- 596-619
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W2090551028
- Cited by
- 617
- References
- 16
- FWCI
- 2.21
- 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.