The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Typed memory management in a calculus of capabilities
Abstract
An increasing number of systems rely on programming language technology to ensure safety and security of low-level code. Unfortunately, these systems typically rely on a complex, trusted garbage collector. Region-based type systems provide an alternative to garbage collection by making memory management explicit but verifiably safe. However, it has not been clear how to use regions in low-level, type-safe code. We present a compiler intermediate language, called the Capability Calculus, that supports region-based memory management, enjoys a provably safe type system, and is straightforward to compile to a typed assembly language. Source languages may be compiled to our language using known region inference algorithms. Furthermore, region lifetimes need not be lexically scoped in our language, yet the language may be checked for safety without complex analyses. Finally, our soundness proof is relatively simple, employing only standard techniques.
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
Girard, J.-Y. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90045-4 · Cited by 4,085
Java Virtual Machine Specification
Lindholm, T., & Yellin, F. (1996) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,155
Necula, G. C. (1997) · Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97 · doi:10.1145/263699.263712 · Cited by 1,843
Notions of computation and monads
Moggi, E. (1991) · Information and Computation · doi:10.1016/0890-5401(91)90052-4 · Cited by 1,688
Schneider, F. B. (2000) · ACM Transactions on Information and System Security · doi:10.1145/353323.353382 · Cited by 1,289
Imperative functional programming
Peyton Jones, S. L., & Wadler, P. (1993) · Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93 · doi:10.1145/158511.158524 · Cited by 1,234
Efficient software-based fault isolation
Wahbe, R., Lucco, S., Anderson, T. E., & Graham, S. L. (1993) · Proceedings of the fourteenth ACM symposium on Operating systems principles - SOSP '93 · doi:10.1145/168619.168635 · Cited by 1,214
Call-by-name, call-by-value and the λ-calculus
Plotkin, G. D. (1975) · Theoretical Computer Science · doi:10.1016/0304-3975(75)90017-1 · Cited by 1,154
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
Extensibility safety and performance in the SPIN operating system
Bershad, B. N., Savage, S., Pardyak, P., Sirer, E. G., Fiuczynski, M. E., Becker, D., Chambers, C., & Eggers, S. (1995) · Proceedings of the fifteenth ACM symposium on Operating systems principles - SOSP '95 · doi:10.1145/224056.224077 · Cited by 955
Definitional interpreters for higher-order programming languages
Reynolds, J. C. (1972) · Proceedings of the ACM annual conference on - ACM '72 · doi:10.1145/800194.805852 · Cited by 669
Region-Based Memory Management
Tofte, M., & Talpin, J.-P. (1997) · Information and Computation · doi:10.1006/inco.1996.2613 · Cited by 615
List processing in real time on a serial computer
Baker, H. G. (1978) · Communications of the ACM · doi:10.1145/359460.359470 · Cited by 592
From system F to typed assembly language
Morrisett, G., Walker, D., Crary, K., & Glew, N. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/319301.319345 · Cited by 584
Self-citationRecognizing safety and liveness
Alpern, B., & Schneider, F. B. (1987) · Distributed Computing · doi:10.1007/bf01782772 · Cited by 557
Safe kernel extensions without run-time checking
Necula, G. C., & Lee, P. (1996) · Proceedings of the second USENIX symposium on Operating systems design and implementation · doi:10.1145/238721.238781 · Cited by 505
(1990) · Cited by 392
The design and implementation of a certifying compiler
Necula, G. C., & Lee, P. (1998) · Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation · doi:10.1145/277650.277752 · Cited by 358
Representing Control: a Study of the CPS Transformation
Danvy, O., & Filinski, A. (1992) · Mathematical Structures in Computer Science · doi:10.1017/s0960129500001535 · Cited by 352
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
Interprocedural may-alias analysis for pointers: beyond k -limiting
Deutsch, A. (1994) · Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation · doi:10.1145/178243.178263 · Cited by 328
Solving shape-analysis problems in languages with destructive updating
Sagiv, M., Reps, T., & Wilhelm, R. (1998) · ACM Transactions on Programming Languages and Systems · doi:10.1145/271510.271517 · Cited by 322
Compiling polymorphism using intensional type analysis
Harper, R., & Morrisett, G. (1995) · Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95 · doi:10.1145/199448.199475 · Cited by 295
Self-citationIs it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C
Ghiya, R., & Hendren, L. J. (1996) · Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96 · doi:10.1145/237721.237724 · Cited by 287
From system F to typed assembly language
Morrisett, G., Walker, D., Crary, K., & Glew, N. (1998) · Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98 · doi:10.1145/268946.268954 · Cited by 282
Self-citationIntegrating functional and imperative programming
Gifford, D. K., & Lucassen, J. M. (1986) · Proceedings of the 1986 ACM conference on LISP and functional programming - LFP '86 · doi:10.1145/319838.319848 · Cited by 226
Memory management with explicit regions
Gay, D., & Aiken, A. (1998) · Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation · doi:10.1145/277650.277748 · Cited by 212
Smith, F., Walker, D., & Morrisett, G. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-46425-5_24 · Cited by 212
Self-citationSyntactic control of interference
Reynolds, J. C. (1978) · Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '78 · doi:10.1145/512760.512766 · Cited by 200
Launchbury, J., & Peyton Jones, S. L. (1995) · LISP and Symbolic Computation · doi:10.1007/bf01018827 · Cited by 185
Higher order operational techniques in semantics
Gordon, A. D., & Pitts, A. M. (1999) · Cambridge University Press eBooks · Cited by 170
Implementing multiple protection domains in java
Hawblitzel, C., Chang, C.-C., Czajkowski, G., Hu, D., & von Eicken, T. (1998) · eCommons (Cornell University) · Cited by 150
A type system for expressive security policies
Walker, D. (2000) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/325694.325728 · Cited by 149
Self-citationAlgebraic reconstruction of types and effects
Jouvelot, P., & Gifford, D. K. (1991) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/99583.99623 · Cited by 145
From region inference to von Neumann machines via region representation inference
Birkedal, L., Tofte, M., & Vejlstrup, M. (1996) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/237721.237771 · Cited by 139
Tofte, M., & Birkedal, L. (1998) · ACM Transactions on Programming Languages and Systems · doi:10.1145/291891.291894 · Cited by 136
Better static memory management: improving region-based analysis of higher-order languages
Aiken, A., Fähndrich, M. A., & Levien, R. (1995) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/207110.207137 · Cited by 135
Syntactic Control of Interference
Reynolds, J. C. (1997) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4612-4118-8_11 · Cited by 93
Wadler, P. L. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57182-5_12 · Cited by 85
Explicit polymorphism and CPS conversion
Harper, R. W., & Lillibridge, M. (1993) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/158511.158630 · Cited by 69
Cited by
Ownership types for safe programming: preventing data races and deadlocks
Boyapati, C., Lee, R., & Rinard, M. (2002) · Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '02 · doi:10.1145/582419.582440 · Cited by 570
Language support for fast and reliable message-based communication in singularity OS
Fähndrich, M., Aiken, M., Hawblitzel, C., Hodson, O., Hunt, G., Larus, J. R., & Levi, S. (2006) · Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006 · doi:10.1145/1217935.1217953 · Cited by 289
Ownership, encapsulation and the disjointness of type and effect
Clarke, D., & Drossopoulou, S. (2002) · Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '02 · doi:10.1145/582419.582447 · Cited by 257
DeLine, R., & Fähndrich, M. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24851-4_21 · Cited by 253
Abstraction-safe effect handlers via tunneling
Zhang, Y., & Myers, A. C. (2019) · Proceedings of the ACM on Programming Languages · doi:10.1145/3290318 · Cited by 45
Metadata
- Authors
- Crary, K., Walker, D., & Morrisett, G.
- Venue
- Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
- Publisher
- ACM
- Published
- 1999-01
- Pages
- 262-275
- OpenAlex
- W2038677544
- Cited by
- 252
- References
- 40
- FWCI
- 18.39
- 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.