The DOI matches its Crossref record; 1 of the 1 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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
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.
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
A type-based approach to program security
Volpano, D., & Smith, G. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0030629 · Cited by 225
Cited by
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
Securing web application code by static analysis and runtime protection
Huang, Y.-W., Yu, F., Hang, C., Tsai, C.-H., Lee, D.-T., & Kuo, S.-Y. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988679 · Cited by 567
The essence of command injection attacks in web applications
Su, Z., & Wassermann, G. (2006) · Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1111037.1111070 · Cited by 515
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
- 1
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A theory of type qualifiers. https://app.cochat.ai/papers/10.1145/301618.301665
- The paper
- Foster, J. S., Fähndrich, M., & Aiken, A. (1999). A theory of type qualifiers. Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation. https://doi.org/10.1145/301618.301665
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.
