The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Reasoning about naming systems
Open accessAbstract
This paper defines a simple model, called a preference hierarchy, that provides a framework for using the information available to a naming system to compute the object(s) identified by a given name. The preference hierarchy therefore serves as a formal tool for designing and reasoning about naming systems.
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
International Organization for Standardization
(2011) · SpringerReference · doi:10.1007/springerreference_16847 · Cited by 12,534
Principles of database and knowledge-base systems
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5107 · Cited by 2,683
Domain names - implementation and specification
Mockapetris, P. V. (1987) · doi:10.17487/rfc1035 · Cited by 1,698
Davis, D. B. (1993) · Datamation · doi:10.5555/169231.169256 · Cited by 1,592
(1988) · Computer Science Press, Inc. eBooks · Cited by 1,435
Ritchie, D. M., & Thompson, K. (1983) · Communications of the ACM · doi:10.1145/357980.358014 · Cited by 960
Ritchie, D. M., & Thompson, K. (1974) · Communications of the ACM · doi:10.1145/361011.361061 · Cited by 826
Logic and Databases: A Deductive Approach
Gallaire, H., Minker, J., & Nicolas, J.-M. (1984) · ACM Computing Surveys · doi:10.1145/356924.356929 · Cited by 733
On semantic issues connected with incomplete information databases
Lipski, W. (1979) · ACM Transactions on Database Systems · doi:10.1145/320083.320088 · Cited by 512
Fabry, R. S. (1974) · Communications of the ACM · doi:10.1145/361011.361070 · Cited by 355
On Databases with Incomplete Information
Lipski, W. (1981) · Journal of the ACM · doi:10.1145/322234.322239 · Cited by 275
The clearinghouse: a decentralized agent for locating named objects in a distributed environment
Oppen, D. C., & Dalal, Y. K. (1983) · ACM Transactions on Information Systems · doi:10.1145/357436.357439 · Cited by 179
Designing a global name service
Lampson, B. W. (1986) · Proceedings of the fifth annual ACM symposium on Principles of distributed computing - PODC '86 · doi:10.1145/10590.10591 · Cited by 167
Caching Hints in Distributed Systems
Terry, D. (1987) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1987.232834 · Cited by 74
Reiter, R. (1989) · Elsevier eBooks · doi:10.1016/b978-0-934613-53-8.50021-2 · Cited by 69
Peterson, L. (1988) · ACM Transactions on Computer Systems · doi:10.1145/48012.48013 · Cited by 65
Self-citationUnderstanding naming in distributed systems
Comer, D. E., & Peterson, L. (1989) · Distributed Computing · doi:10.1007/bf01558663 · Cited by 24
Self-citation
Cited by
Fog computing and its role in the internet of things
Bonomi, F., Milito, R., Zhu, J., & Addepalli, S. (2012) · Proceedings of the first edition of the MCC workshop on Mobile cloud computing · doi:10.1145/2342509.2342513 · Cited by 6,244
Building efficient wireless sensor networks with low-level naming
Heidemann, J., Silva, F., Intanagonwiwat, C., Govindan, R., Estrin, D., & Ganesan, D. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502049 · Cited by 598
Caching in information centric networking: A survey
Zhang, G., Li, Y., & Lin, T. (2013) · Computer Networks · doi:10.1016/j.comnet.2013.07.007 · Cited by 358
Affective Grounding in Human-Robot Interaction
Jung, M. F. (2017) · Proceedings of the 2017 ACM/IEEE International Conference on Human-Robot Interaction · doi:10.1145/2909824.3020224 · Cited by 142
Metadata
- Authors
- Bowman, M., Debray, S. K., & Peterson, L. L.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 1993-11
- Volume
- 15
- Issue
- 5
- Pages
- 795-825
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W2043539602
- Cited by
- 402
- References
- 17
- FWCI
- 0.99
- 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.