The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Capability-based addressing
Open accessAbstract
Various addressing schemes making use of segment tables are examined. The inadequacies of these schemes when dealing with shared addresses are explained. These inadequacies are traced to the lack of an efficient absolute address for objects in these systems. The direct use of a capability as an address is shown to overcome these difficulties because it provides the needed absolute address. Implementation of capability-based addressing is discussed. It is predicted that the use of tags to identify capabilities will dominate. A hardware address translation scheme which never requires the modification of the representation of capabilities is suggested. The scheme uses a main memory hash table for obtaining a segment's location in main memory given its unique code. The hash table is avoided for recently accessed segments by means of a set of associative registers. A computer using capability-based addressing may be substantially superior to present systems on the basis of protection, simplicity of programming conventions, and efficient implementation.
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
Programming semantics for multiprogrammed computations
Dennis, J. B., & Van Horn, E. C. (1983) · Communications of the ACM · doi:10.1145/357980.357993 · Cited by 676
Programming semantics for multiprogrammed computations
Dennis, J. B., & Van Horn, E. C. (1966) · Communications of the ACM · doi:10.1145/365230.365252 · Cited by 575
The multics system: an examination of its structure
(1972) · Cited by 386
Protection - Principles and practice
Graham, G., & Denning, P. J. (1972) · Managing Requirements Knowledge, International Workshop on · doi:10.1109/afips.1972.91 · Cited by 366
Protection: principles and practice
Graham, G. S., & Denning, P. J. (1971) · Proceedings of the November 16-18, 1971, fall joint computer conference on - AFIPS '71 (Fall) · doi:10.1145/1478873.1478928 · Cited by 227
Lampson, B. (1969) · AFIPS Fall Joint Computer Conference (FJCC) · doi:10.1145/1478559.1478563 · Cited by 177
Harrison, M. C., & Wilkes, M. V. (1970) · Mathematics of Computation · doi:10.2307/2004522 · Cited by 158
Segmentation and the Design of Multiprogrammed Computer Systems
Dennis, J. B. (1965) · Journal of the ACM · doi:10.1145/321296.321310 · Cited by 153
Virtual memory, processes, and sharing in MULTICS
Daley, R. C., & Dennis, J. B. (1968) · Communications of the ACM · doi:10.1145/363095.363139 · Cited by 150
A General-Purpose File System for Secondary Storage
Daley, R. C., & Neumann, P. G. (1965) · Springer eBooks · doi:10.1007/978-1-4757-3510-9_9 · Cited by 148
On The Advantages of Tagged Architecture
Feustel, E. A. (1973) · IEEE Transactions on Computers · doi:10.1109/tc.1973.5009130 · Cited by 147
The Multics virtual memory: concepts and design
Bensoussan, A., Clingen, C. T., & Daley, R. C. (1972) · Communications of the ACM · doi:10.1145/355602.361306 · Cited by 139
Berry, D. M. (1971) · ACM SIGPLAN Notices · doi:10.1145/1115880.1115887 · Cited by 45
A Dynamic Storage Allocation Scheme
Iliffe, J. K., & Jodeit, J. G. (1962) · The Computer Journal · doi:10.1093/comjnl/5.3.200 · Cited by 43
Protection systems and protection implementations
Needham, R. M. (1972) · AFIPS Fall Joint Computer Conference (FJCC) · doi:10.1145/1479992.1480073 · Cited by 39
Address mapping and the control of access in an interactive computer
Evans, D. C., & Leclerc, J. Y. (1967) · AFIPS Spring Joint Computer Conference (SJCC) · doi:10.1145/1465482.1465486 · Cited by 29
Cited by
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
“3. Protected objects and protected subsystems [30], [ 45 ], [54], [59], [70]-[72].”
Protection of information in computer systems
Saltier, J. H., & Schroeder, M. P. (1975) · IEEE CSIT Newsletter · doi:10.1109/csit.1975.6498831 · Cited by 1,419
A calculus for access control in distributed systems
Abadi, M., Burrows, M., Lampson, B., & Plotkin, G. (1993) · ACM Transactions on Programming Languages and Systems · doi:10.1145/155183.155225 · Cited by 575
Reasoning about naming systems
Bowman, M., Debray, S. K., & Peterson, L. L. (1993) · ACM Transactions on Programming Languages and Systems · doi:10.1145/161468.161471 · Cited by 402
Improving the reliability of commodity operating systems
Swift, M. M., Bershad, B. N., & Levy, H. M. (2005) · ACM Transactions on Computer Systems · doi:10.1145/1047915.1047919 · Cited by 338
Metadata
- Authors
- Fabry, R. S.
- Venue
- Communications of the ACM
- Published
- 1974-07
- Volume
- 17
- Issue
- 7
- Pages
- 403-412
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2060468294
- Cited by
- 355
- References
- 16
- FWCI
- 15.05
- 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.