DMCA
Reasoning about naming systems (1993)
Cached
Download Links
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.ece.rutgers.edu]
- [www.cs.utexas.edu]
- [www.cs.arizona.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | ACM Transactions on Programming Languages and Systems |
| Citations: | 97 - 1 self |
BibTeX
@ARTICLE{Bowman93reasoningabout,
author = {Mic Bowman and Saumya K. Debray and Larry L. Peterson},
title = {Reasoning about naming systems},
journal = {ACM Transactions on Programming Languages and Systems},
year = {1993},
volume = {15},
pages = {795--825}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper reasons about naming systems as specialized inference mechanisms, It describes a preference)-zierarch.v that can be used to specify the structure of a naming system’s inference mechanism and defines criteria by which different naming systems can be evaluated, For example, the preference hierarchy allows one to compare naming systems based on how dkcrzmznating they are and to identify the class of names for which a given naming system is sound and complete. A study of several example naming systems demonstrates how the prefer-ence hierarchy can be used as a formal tool for designing naming systems. Categories and Subject Descriptors: H.2.3 [Database Management]: Languages—query lan-guages; H.2.4 [Database Management]: Systems—query processing; H.3.3 [Information
