The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Data Flow Program Graphs
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.
Integrity signals
Registry
Cites
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.
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
Petri Net theory and the modeling of systems
(1982) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(82)90066-0 · Cited by 3,609
Ritchie, D. M., & Thompson, K. (1983) · Communications of the ACM · doi:10.1145/357980.358014 · Cited by 960
The Mechanical Evaluation of Expressions
Landin, P. J. (1964) · The Computer Journal · doi:10.1093/comjnl/6.4.308 · Cited by 926
Structured Analysis (SA): A Language for Communicating Ideas
Ross, D. T. (1977) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1977.229900 · Cited by 867
Ritchie, D. M., & Thompson, K. (1974) · Communications of the ACM · doi:10.1145/361011.361061 · Cited by 826
A new implementation technique for applicative languages
Turner, D. A. (1979) · Software: Practice and Experience · doi:10.1002/spe.4380090105 · Cited by 610
McCarthy, J., Abrahams, P. W., Edwards, D. J., Hart, T. P., & Levin, M. I. (1962) · doi:10.21236/ad0406138 · Cited by 555
Coroutines and networks of parallel processes
Kahn, G., & MacQueen, D. B. (1976) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 492
Design of a separable transition-diagram compiler
Conway, M. E. (1963) · Communications of the ACM · doi:10.1145/366663.366704 · Cited by 437
Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
Karp, R. M., & Miller, R. E. (1966) · SIAM Journal on Applied Mathematics · doi:10.1137/0114108 · Cited by 421
Henderson, P., & Morris, J. H. (1976) · Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages - POPL '76 · doi:10.1145/800168.811543 · Cited by 325
HABER, R. N. (1974) · Historical and Philosophical Roots of Perception · doi:10.1016/b978-0-12-161901-5.50023-6 · Cited by 269
Lucid, a nonprocedural language with iteration
Ashcroft, E. A., & Wadge, W. W. (1977) · Communications of the ACM · doi:10.1145/359636.359715 · Cited by 241
An asynchronous programming language and computing machine
Arvind, A., Gostelow, K. P., & Plouffe, W. (1978) · eScholarship (California Digital Library) · Cited by 207
Automata, Languages and Programming
(1974) · Lecture notes in computer science · doi:10.1007/3-540-06841-4 · Cited by 150
A loosely-coupled applicative multi-processing system
Keller, R., Lindstrom, G. E., & Patil, S. (1979) · International Workshop on Managing Requirements Knowledge (MARK) · doi:10.1109/mark.1979.8817294 · Cited by 110
Rumbaugh, J. E. (1977) · IEEE Transactions on Computers · doi:10.1109/tc.1977.5009292 · Cited by 105
Kock, W. E. (1961) · Physics Today · doi:10.1063/1.3057269 · Cited by 61
Cited by
The program dependence graph and its use in optimization
Ferrante, J., Ottenstein, K. J., & Warren, J. D. (1987) · ACM Transactions on Programming Languages and Systems · doi:10.1145/24039.24041 · Cited by 2,755
Lee, E. A., & Messerschmitt, D. G. (1987) · Proceedings of the IEEE · doi:10.1109/proc.1987.13876 · Cited by 1,842
Advances in dataflow programming languages
Johnston, W. M., Hanna, J. R. P., & Millar, R. J. (2004) · ACM Computing Surveys · doi:10.1145/1013208.1013209 · Cited by 503
Metadata
- Authors
- Davis, & Keller
- Venue
- Computer
- Published
- 1982-02
- Volume
- 15
- Issue
- 2
- Pages
- 26-41
- ISSN
- 0018-9162 (ISSN-L)
- OpenAlex
- W2105816471
- Cited by
- 287
- References
- 18
- FWCI
- 14.04
- Type
- journal article
- Language
- en
- Open access
- closed
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.