The DOI matches its Crossref record.
Unwinding and Inference Control
Abstract
This paper discusses two main ideas, unwinding and inference control. While both concern computer security, they are not closely related to each other. Unwinding is a verification technique for general security requirements based on noninterference assertions as in [Goguen & Meseguer 82a]. The inference control problem concerns preventing inference of unauthorized information by combining authorized information. The main result in this paper is an unwinding theorem that gives a very simple necessary and sufficient condition for a system to satisfy the MLS security policy system. A subsidiary topic is secure interfaces, which we show how to treat with noninterferce assertions.
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
Cited by
Language-based information-flow security
Sabelfeld, A., & Myers, A. C. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.806121 · Cited by 1,907
Privacy-preserving data publishing: A survey of recent developments
Fung, B. C. M., Wang, K., Chen, R., & Yu, P. S. (2010) · ACM Computing Surveys · doi:10.1145/1749603.1749605 · Cited by 1,704
A decentralized model for information flow control
Myers, A. C., & Liskov, B. (1997) · Proceedings of the sixteenth ACM symposium on Operating systems principles · doi:10.1145/268998.266669 · Cited by 536
Dimensions and Principles of Declassification
Sabelfeld, A., & Sands, D. (2005) · 18th IEEE Computer Security Foundations Workshop (CSFW'05) · doi:10.1109/csfw.2005.15 · Cited by 263
Noninterference and the composability of security properties
McCullough, D. (2003) · Proceedings. 1988 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.1988.8110 · Cited by 261
Metadata
- Authors
- Goguen, J. A., & Meseguer, J.
- Venue
- 1984 IEEE Symposium on Security and Privacy
- Publisher
- IEEE
- Published
- 1984-04
- Pages
- 75-75
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2080914957
- Cited by
- 429
- References
- 0
- Type
- conference abstract
- Language
- en
- Open access
- closed
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: Unwinding and Inference Control. https://app.cochat.ai/papers/10.1109/sp.1984.10019
- The paper
- Goguen, J. A., & Meseguer, J. (1984). Unwinding and Inference Control. 1984 IEEE Symposium on Security and Privacy. https://doi.org/10.1109/sp.1984.10019
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.