The DOI matches its Crossref record; 28 of the 28 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
Weiser, M. (1984) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1984.5010248 · Cited by 3,204
The program dependence graph and its use in optimization
Ferrante, J., Ottenstein, K. J., & Warren, J. D. (1987) · ACM Transactions on Programming Languages and Systems · doi:10.1145/24039.24041 · Cited by 2,755
A lattice model of secure information flow
Denning, D. E. (1976) · Communications of the ACM · doi:10.1145/360051.360056 · Cited by 1,907
Notions of computation and monads
Moggi, E. (1991) · Information and Computation · doi:10.1016/0890-5401(91)90052-4 · Cited by 1,688
Introduction to Higher Order Categorical Logic.
Bell, J. L., Lambek, J., & Scott, P. (1989) · Journal of Symbolic Logic · doi:10.2307/2274784 · Cited by 1,083
JFlow: practical mostly-static information flow control
Myers, A. C. (1999) · Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/292540.292561 · Cited by 1,034
Certification of programs for secure information flow
Denning, D. E., & Denning, P. J. (1977) · Communications of the ACM · doi:10.1145/359636.359712 · Cited by 1,029
A sound type system for secure flow analysis
Volpano, D., Irvine, C., & Smith, G. (1996) · Journal of Computer Security · doi:10.3233/jcs-1996-42-304 · Cited by 969
A Survey of Program Slicing Techniques.
Tip, F. (1994) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 952
Types, Abstraction and Parametric Polymorphism.
Reynolds, J. (1983) · IFIP Congress · Cited by 754
Encyclopedia of software engineering
(1994) · Choice Reviews Online · doi:10.5860/choice.32-0639 · Cited by 707
Region-Based Memory Management
Tofte, M., & Talpin, J.-P. (1997) · Information and Computation · doi:10.1006/inco.1996.2613 · Cited by 615
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
The SLam calculus: programming with secrecy and integrity
Heintze, N., & Riecke, J. G. (1998) · Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98 · doi:10.1145/268946.268976 · Cited by 410
Self-citationSecure information flow in a multi-threaded imperative language
Smith, G., & Volpano, D. (1998) · Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98 · doi:10.1145/268946.268975 · Cited by 406
Secrecy by typing in security protocols
Abadi, M. (1999) · Journal of the ACM · doi:10.1145/324133.324266 · Cited by 314
Self-citationThe theory and practice of first-class prompts
Felleisen, M. (1988) · Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '88 · doi:10.1145/73560.73576 · Cited by 292
A modal analysis of staged computation
Davies, R., & Pfenning, F. (1996) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/237721.237788 · Cited by 143
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
Secrecy by typing in security protocols
Abadi, M. (1997) · Lecture notes in computer science · doi:10.1007/bfb0014571 · Cited by 105
Self-citationA Per Model of Secure Information Flow in Sequential Programs
Sabelfeld, A., & Sands, D. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49099-x_4 · Cited by 104
Ø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
Binding time analysis for high order untyped functional languages
Consel, C. (1990) · ACM Conference on LISP and Functional Programming (LFP) · doi:10.1145/91556.91668 · Cited by 84
Reynolds, C. R. (2008) · Encyclopedia of Special Education · doi:10.1002/9780470373699.speced1086 · Cited by 81
A Temporal Logic Approach to Binding-Time Analysis
Davies, R. (2017) · Journal of the ACM · doi:10.1145/3011069 · Cited by 73
A computational formalization for partial evaluation
Hatcliff, J., & Danvy, O. (1997) · Mathematical Structures in Computer Science · doi:10.1017/s0960129597002405 · Cited by 71
A security flow control algorithm and its denotational semantics correctness proof
Mizuno, M., & Schmidt, D. A. (1992) · Formal Aspects of Computing · doi:10.1007/bf03180570 · Cited by 58
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
Protecting privacy using the decentralized label model
Myers, A. C., & Liskov, B. (2000) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/363516.363526 · Cited by 556
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
A brief survey of program slicing
Xu, B., Qian, J., Zhang, X., Wu, Z., & Chen, L. (2005) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1050849.1050865 · Cited by 313
Observational determinism for concurrent program security
Zdancewic, S., & Myers, A. C. (2004) · 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings. · doi:10.1109/csfw.2003.1212703 · Cited by 270
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
- 28
- 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
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.