The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A core calculus of dependency
Abstract
Notions of program dependency arise in many settings: security, partial evaluation, program slicing, and call-tracking. We argue that there is a central notion of dependency common to these settings that can be captured within a single calculus, the Dependency Core Calculus (DCC), a small extension of Moggi's computational lambda calculus. To establish this thesis, we translate typed calculi for secure information flow, binding-time analysis, slicing, and call-tracking into DCC. The translations help clarify aspects of the source calculi. We also define a semantic model for DCC and use it to give simple proofs of noninterference results for each case.
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 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
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
Simple relational correctness proofs for static analyses and program transformations
Benton, N. (2004) · Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/964001.964003 · Cited by 356
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
Information flow inference for ML
Pottier, F., & Simonet, V. (2003) · ACM Transactions on Programming Languages and Systems · doi:10.1145/596980.596983 · Cited by 262
A Core Quantitative Coeffect Calculus
Brunel, A., Gaboardi, M., Mazza, D., & Zdancewic, S. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-54833-8_19 · Cited by 90
Metadata
- Authors
- Abadi, M., Banerjee, A., Heintze, N., & Riecke, J. G.
- Venue
- Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
- Publisher
- ACM
- Published
- 1999-01
- Pages
- 147-160
- OpenAlex
- W2067012475
- Cited by
- 413
- References
- 1
- FWCI
- 15.00
- Type
- conference paper
- 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: A core calculus of dependency. https://app.cochat.ai/papers/10.1145/292540.292555
- The paper
- Abadi, M., Banerjee, A., Heintze, N., & Riecke, J. G. (1999). A core calculus of dependency. Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. https://doi.org/10.1145/292540.292555
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.