The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
A theory of type qualifiers
Open accessAbstract
We describe a framework for adding type qualifiers to a language. Type qualifiers encode a simple but highly useful form of subtyping. Our framework extends standard type rules to model the flow of qualifiers through a program, where each qualifier or set of qualifiers comes with additional rules that capture its semantics. Our framework allows types to be polymorphic in the type qualifiers. We present a const-inference system for C as an example application of the framework. We show that for a set of real C programs, many more consts can be used than are actually present in the original code.
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
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,448
A theory of type polymorphism in programming
Milner, R. (1978) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(78)90014-4 · Cited by 2,205
Kernighan, B. W., & Ritchie, D. M. (1978) · Cited by 1,857
A Syntactic Approach to Type Soundness
Wright, A. K., & Felleisen, M. (1994) · Information and Computation · doi:10.1006/inco.1994.1093 · Cited by 1,136
Abadi, M., & Cardelli, L. (1996) · Monographs in Computer Science · doi:10.1007/978-1-4419-8598-9 · Cited by 1,001
Lucassen, J. M., & Gifford, D. K. (1988) · Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '88 · doi:10.1145/73560.73564 · Cited by 481
Titanium: a high-performance Java dialect
Yelick, K., Semenzato, L., Pike, G., Miyamoto, C., Liblit, B., Krishnamurthy, A., Hilfinger, P., Graham, S., Gay, D., Colella, P., et al. (1998) · Concurrency: Practice and Experience · doi:10.1002/(sici)1096-9128(199809/11)10:11/13<825::aid-cpe383>3.0.co;2-h · Cited by 451
Self-citationAbadi, M., Banerjee, A., Heintze, N., & Riecke, J. G. (1999) · Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/292540.292555 · Cited by 413
Implementation of the typed call-by-value λ-calculus using a stack of regions
Tofte, M., & Talpin, J.-P. (1994) · Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94 · doi:10.1145/174675.177855 · Cited by 337
A type-based approach to program security
Volpano, D., & Smith, G. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0030629 · Cited by 225
Type inference with constrained types
Odersky, M., Sulzmann, M., & Wehr, M. (1999) · Theory and Practice of Object Systems · doi:10.1002/(sici)1096-9942(199901/03)5:1<35::aid-tapo4>3.0.co;2-4 · Cited by 216
STL tutorial and reference guide
Musser, D. R., & Saini, A. (2001) · Cited by 208
Simple imperative polymorphism
Wright, A. K. (1995) · LISP and Symbolic Computation · doi:10.1007/bf01018828 · Cited by 196
The marriage of effects and monads
Wadler, P. L. (1998) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/289423.289429 · Cited by 129
Jones, M. P. (1994) · Science of Computer Programming · doi:10.1016/0167-6423(94)00005-0 · Cited by 109
Ørbæk, P., & Palsberg, J. (1997) · Journal of Functional Programming · doi:10.1017/s0956796897002906 · Cited by 98
Palsberg, J., & Ørbæk, P. (1995) · Cited by 86
A toolkit for constructing type- and constraint-based program analyses
Aiken, A., Fähndrich, M. A., Foster, J. S., & Su, Z. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055513 · Cited by 52
Self-citationTaming effects with monadic typing
Kieburtz, R. B. (1998) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/289423.289428 · Cited by 20
Cited by
Newsome, J., & Song, D. X. (2018) · Figshare · doi:10.1184/r1/6468716 · Cited by 1,270
Hovemeyer, D., & Pugh, W. (2004) · Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications · doi:10.1145/1028664.1028717 · Cited by 760
Pixy: a static analysis tool for detecting Web application vulnerabilities
Jovanovic, N., Kruegel, C., & Kirda, E. (2006) · 2006 IEEE Symposium on Security and Privacy (S&P'06) · doi:10.1109/sp.2006.29 · Cited by 722
Schwartz, E. J., Avgerinos, T., & Brumley, D. (2010) · 2010 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2010.26 · Cited by 717
Countering code-injection attacks with instruction-set randomization
Kc, G. S., Keromytis, A. D., & Prevelakis, V. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948146 · Cited by 646
Metadata
- Authors
- Foster, J. S., Fähndrich, M., & Aiken, A.
- Venue
- Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
- Publisher
- ACM
- Published
- 1999-05
- Pages
- 192-203
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W1963569294
- Cited by
- 261
- References
- 20
- FWCI
- 3.96
- Type
- conference paper
- 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.