Programming semantics for multiprogrammed computations
Open accessAbstract
The semantics are defined for a number of meta-instructions which perform operations essential to the writing of programs in multiprogrammed computer systems. These meta-instructions relate to parallel processing, protecting of separate computations, program debugging, and the sharing among users of memory segments and other computing objects, the names of which are hierarchically structured. The language sophistication contemplated is midway between an assembly language and an advanced algebraic language.
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
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Capability systems established unforgeable authority tokens, delegation by possession, attenuation, and the importance of controlling the complete path to an object.
“Capability systems established unforgeable authority tokens, delegation by possession, attenuation, and the importance of controlling the complete path to an object [1, 7, 20].”
From Authorization for Self-Modifying AI Agent Populations: Conserving Authority across Replacement, Forking, and Rollback (2026) · cites this paper as [7]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
No references could be resolved yet.
Research works printed but not linked: 29
- PEIRCE, C. S. Collected Papers• Harvard Press, Cambridge, Mass. Vol. 1-6, 1931-1935. Philosophical Writings. (J. Buchler, Ed.). Routledge and Kegan Paul, London, 1940; or Dover Publications, New York, 1955; 368 pp.
- BOCttENSKI, I. M. A History of Formal Logic. U. of Notre Dame Press, Notre Dame, Indiana, 1961; pp. 99-100.
- MORRIS, C. Foundations of the theory of signs. In Interna- tional Encyclopedia of Unified Science, Vol. 1, No. 2, Uni- versity of Chicago Press, Chicago, 1938.
- BOLTZMANN, L. Vorlesungen ueber Gastheorie, 1. Theil, Paragraph 6. Mathematische Bedeutung der Groesse H, J. A. Barth, Leipzig, 1895, pp. 38-42.
- • SHANNON, C.E. A mathematical theory of communication. Bell System Tech. J. 27 (1948), 379-433; 623-656.
- KRAFT, V. Der Wiener Kreis. Springer Verlag, Vienna, 1950.
- • WITTGENSTEIN, L. Tractatus Logico-Philosophicus. First Print in German, 1921; in English: Routledge and Kegan Paul, London, 1922.
- FEIGI~, H. Logical empirism. InTwentieth Century Philosophy (D. D. Runes, Ed.), Philosophical Library, New York, 1943, pp. 373-416.
- --. Introduction to Semantics• Harvard University Press, Cambridge, Mass., 1942.
- Formal Language Description Languages (T. B. Steel, Jr., Ed.). Proc. of the IFIP Working Conf., Vienna, 1964; North Hol- land, Amsterdam 1966.
- GORN, S. Some basic terminology connected with mechanical languages and their processors• Comm. ACM 4 (1961), 336- 339.
- --. Mechanical pragmatics: a time motion study of a mini- ature mechanical linguistic system. Comm. ACM 5 (1962), 576-589.
- HAMLIN, J . E . A generM description of the National Aero- nautics and Space Administration real time computing complex. Proc. ACM 19th Nat. Conf., Philadelphia, 1964, pp. 2-1 to 2-22.
- FANO, .l~. M. The MAC system: the computer utility ap- proach. IEEE Spectrum 2 (Jan. 1965), 56-64.
- DENNIS, J. B., AND GLASEE, E. The structure of on-line in- formation processing systems. Information Systems Sci- ences: Proc. Second Cong., Spartan Books, Baltimore, 1965, pp. 1-11.
- GREENFIELD, M. N. FACT segmentation. AFIPS Conf. Proc. 21, Spartan Books, Baltimore, 1962, pp. 307-315.
- HOLT, A.W. Program organization and record keeping for dynamic storage allocation. Comm. ACM 4 (Oct. 1961), 422-431.
- I)ENNIS~ Z. B. Segmentation and the design of multipro- grammed computer systems. J. ACM 12 (Oct. 1965), 589-602.
- GLASER, E., COULEUR, J., ANn OLIVER, O. System design of a computer for time-sharing applications. AFIPS Conf. Proc. 28, Spartan Books, Baltimore, 1965, p. 197-202.
- FORGIE, J.W. A time-and memory-sharing executive pro- gram for quick-response, on-line applications. AFIPS Conf. Proc. 28, Spartan Books, Baltimore, 1965, p. 599-609.
- COMFORT, W.T. A computing system design for user service. AFIPS Conf. Proe. 28, Spartan Books, Baltimore, 1965, p. 619-626.
- McCuLLOUGH, J. D., SPEIERMAN, K. H., AND ZURCHER, F. W. A design for a multiple user multiprocessing system. AFIPS Conf. Proc. 28, Spartan Books, Baltimore, 1965, p. 611-617.
- DENNIS, Z. B. Program structure in a multi-access com- puter. Tech. Rep. No. MAC-TR-11, Proj. MAC, MIT, Cambridge, Mass., 1964.
- CONWAY, M. A multiprocessor system design. AFIPS Conf. Proc. 24, Spartan Books, Baltimore, 1963, pp. 139-146.
- CRISMAN, P. (ED.) The Compatible Time-Sharing System: A Programmer's Guide. MIT Press, Cambridge, Mass., 2d ed., 1965, sec. AD. 2.
- HoslEn, W. A. Pitfalls and safeguards in real-time digital systems with emphasis on programming. IRE Trans. EM-8 (June 1961), 99-115.
- McCARTHY, J., COR~ATO, F. J., AND DAGGETT, M.M. The linking segment subprogram language and linking loader. Comm. ACM 6 (July 1963), 391-395.
- MIT COMPUTATION CENTER. The Compatible Time-Sharing System: A Programmer's Guide. MIT Press, Cambridge, Mass., 1st ed. 1963.
- DALE¥, R. C., AND NEUMAN, P. G. A general purpose file system for secondary storage. AFIPS Conf. Proc. 28, Spar- tan Books, Baltimore, 1965, p. 213-229.
Cited by
Sorted by citations
Language-based information-flow security
Sabelfeld, A., & Myers, A. C. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.806121 · Cited by 1,907 · see citing works
The protection of information in computer systems
Saltzer, J. H., & Schroeder, M. D. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.9939 · Cited by 2,126 · see citing works
seL4: From General Purpose to a Proof of Information Flow Enforcement
Murray, T., Matichuk, D., Brassil, M., Gammie, P., Bourke, T., Seefried, S., Lewis, C., Gao, X., & Klein, G. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.35 · Cited by 205 · see citing works
Executable formal semantics for the POSIX shell
Greenberg, M., & Blatt, A. J. (2020) · Proceedings of the ACM on Programming Languages · doi:10.1145/3371111 · Cited by 21 · see citing works
“To show that Smoosh is a good model for the POSIX shell, we compare it against other shells in three different test suites: the POSIX test suite, the Modernish test suite and shell diagnostic [Dekker 2019], and a test suite of our own device (Section 7).”
MethodZhu, G., & Wang, C. (2026) · arXiv · doi:10.48550/arxiv.2610.00347
- Authors
- Dennis, J. B., & Van Horn, E. C.
- Affiliations
- Massachusetts Institute of Technology (US)
- Massachusetts Institute of Technology, Cambridge
- Venue
- Communications of the ACM
- Published
- 1966-03
- Volume
- 9
- Issue
- 3
- Pages
- 143-155
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W4249212548
- Cited by
- 575
- References
- 0
- Citations by year
- 2026: 20 · 2025: 13 · 2024: 8 · 2023: 13 · 2022: 15 · 2021: 14 · 2020: 10 · 2019: 18 · 2018: 18 · 2017: 15 · 2016: 22 · 2015: 10 · 2014: 10 · 2013: 11 · 2012: 13
- FWCI
- 13.66
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Communications of the ACM (publishedVersion)
- Funders
- U.S. Department of Defense
- Advanced Research Projects Agency
- Office of Naval Research
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
- Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
- Physical Sciences › Computer Science › Computer Science Applications › Teaching and Learning Programming
- Keywords
- program semantics, multiprogramming, parallel computing, debugging, memory sharing, hierarchical naming, program protection, assembly language, algebraic language
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
