The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
RustBelt: securing the foundations of the Rust programming language
Open accessAbstract
Rust is a new systems programming language that promises to overcome the seemingly fundamental tradeoff between high-level safety guarantees and low-level control over resource management. Unfortunately, none of Rust's safety claims have been formally proven, and there is good reason to question whether they actually hold. Specifically, Rust employs a strong, ownership-based type system, but then extends the expressive power of this core type system through libraries that internally use unsafe features. In this paper, we give the first formal (and machine-checked) safety proof for a language representing a realistic subset of Rust. Our proof is extensible in the sense that, for each new Rust library that uses unsafe features, we can say what verification condition it must satisfy in order for it to be deemed a safe extension to the language. We have carried out this verification for some of the most important libraries that are used throughout the Rust ecosystem.
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
Stroustrup, B. (1985) · Cited by 3,940
A theory of type polymorphism in programming
Milner, R. (1978) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(78)90014-4 · Cited by 2,205
Separation logic: a logic for shared mutable data structures
Reynolds, J. C. (2003) · Proceedings 17th Annual IEEE Symposium on Logic in Computer Science · doi:10.1109/lics.2002.1029817 · Cited by 2,156
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
Appel, A. W. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511609619 · Cited by 824
Jim, T., Morrisett, J. G., Grossman, D., Hicks, M., Cheney, J., & Wang, Y.-L. (2002) · Cited by 605
Ownership types for flexible alias protection
Clarke, D. G., Potter, J. M., & Noble, J. (1998) · Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications · doi:10.1145/286936.286947 · Cited by 580
Intensional interpretations of functionals of finite type I
Tait, W. W. (1967) · Journal of Symbolic Logic · doi:10.2307/2271658 · Cited by 557
Resources, concurrency, and local reasoning
O’Hearn, P. W. (2007) · Theoretical Computer Science · doi:10.1016/j.tcs.2006.12.035 · Cited by 552
Region-based memory management in cyclone
Grossman, D., Morrisett, G., Jim, T., Hicks, M., Wang, Y., & Cheney, J. (2002) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/512529.512563 · Cited by 403
(1990) · Cited by 392
Checking interference with fractional permissions
Boyland, J. (2003) · Cited by 382
Iris from the ground up: A modular foundation for higher-order concurrent separation logic
JUNG, R., KREBBERS, R., JOURDAN, J.-H., BIZJAK, A., BIRKEDAL, L., & DREYER, D. (2018) · Journal of Functional Programming · doi:10.1017/s0956796818000151 · Cited by 372
Self-citationAn indexed model of recursive types for foundational proof-carrying code
Appel, A. W., & McAllester, D. (2001) · ACM Transactions on Programming Languages and Systems · doi:10.1145/504709.504712 · Cited by 348
Dependent types and multi-monadic effects in F*
Swamy, N., Hriţcu, C., Keller, C., Rastogi, A., Delignat-Lavaud, A., Forest, S., Bhargavan, K., Fournet, C., Strub, P.-Y., Kohlweiss, M., et al. (2016) · Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages · doi:10.1145/2837614.2837655 · Cited by 314
Foundational proof-carrying code
Appel, A. W. (2002) · Proceedings 16th Annual IEEE Symposium on Logic in Computer Science · doi:10.1109/lics.2001.932501 · Cited by 308
Matsakis, N. D., & Klock, F. S. (2014) · Proceedings of the 2014 ACM SIGAda annual conference on High integrity language technology · doi:10.1145/2663171.2663188 · Cited by 287
Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning
Jung, R., Swasey, D., Sieczkowski, F., Svendsen, K., Turon, A., Birkedal, L., & Dreyer, D. (2015) · Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages · doi:10.1145/2676726.2676980 · Cited by 276
Self-citationChecking Interference with Fractional Permissions
Boyland, J. (2003) · Lecture notes in computer science · doi:10.1007/3-540-44898-5_4 · Cited by 262
Program Logics for Certified Compilers
Appel, A. W., Dockins, R., Hobor, A., Beringer, L., Dodds, J., Stewart, G., Blazy, S., & Leroy, X. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781107256552 · Cited by 171
Views: compositional reasoning for concurrent programs
Dinsdale-Young, T., Birkedal, L., Gardner, P., Parkinson, M., & Yang, H. (2013) · Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/2429069.2429104 · Cited by 159
Nanevski, A., Morrisett, G., Shinnar, A., Govereau, P., & Birkedal, L. (2008) · ACM SIGPLAN Notices · doi:10.1145/1411203.1411237 · Cited by 148
Nanevski, A., Morrisett, G., Shinnar, A., Govereau, P., & Birkedal, L. (2008) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/1411204.1411237 · Cited by 147
A very modal model of a modern, major, general type system
Appel, A. W., Melliès, P.-A., Richards, C. D., & Vouillon, J. (2007) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1190216.1190235 · Cited by 143
Interactive proofs in higher-order concurrent separation logic
Krebbers, R., Timany, A., & Birkedal, L. (2016) · doi:10.1145/3009837.3009855 · Cited by 129
Self-citationThe Essence of Higher-Order Concurrent Separation Logic
Krebbers, R., Jung, R., Bizjak, A., Jourdan, J.-H., Dreyer, D. R., & Birkedal, L. (2017) · Lecture notes in computer science · doi:10.1007/978-3-662-54434-1_26 · Cited by 126
Self-citationA very modal model of a modern, major, general type system
Appel, A. W., Melliès, P.-A., Richards, C. D., et al. (2007) · ACM SIGPLAN Notices · doi:10.1145/1190215.1190235 · Cited by 113
Jung, R., Krebbers, R., Birkedal, L., & Dreyer, D. R. (2016) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/2951913.2951943 · Cited by 113
Self-citationL3: A Linear Language with Locations
Morrisett, G., Ahmed, A. J., & Fluet, M. T. (2005) · Lecture notes in computer science · doi:10.1007/11417170_22 · Cited by 112
Semantics of types for mutable state
Ahmed, A. J. (2004) · Cited by 102
Logical Step-Indexed Logical Relations
Dreyer, D. R., Ahmed, A. J., & Birkedal, L. (2009) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.2009.34 · Cited by 93
Self-citationTov, J. A., & Pucella, R. (2011) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1926385.1926436 · Cited by 78
Amani, S., Hixon, A., Chen, Z., et al. (2016) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/2872362.2872404 · Cited by 69
Logical Step-Indexed Logical Relations
Dreyer, D. R., Ahmed, A. J., & Birkedal, L. (2011) · Logical Methods in Computer Science · doi:10.2168/lmcs-7(2:16)2011 · Cited by 64
Self-citationTov, J. A., & Pucella, R. (2011) · ACM SIGPLAN Notices · doi:10.1145/1925844.1926436 · Cited by 61
Timany, A., Stefanesco, L., Krogh-Jespersen, M., & Birkedal, L. (2018) · Proceedings of the ACM on Programming Languages · doi:10.1145/3158152 · Cited by 51
A step-indexed model of substructural state
Ahmed, A. J., Fluet, M. T., & Morrisett, G. (2005) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/1086365.1086376 · Cited by 46
Semantic foundations for typed assembly languages
Ahmed, A. J., Appel, A. W., Richards, C. D., Swadi, K. N., Tan, G., & Wang, D. C. (2010) · ACM Transactions on Programming Languages and Systems · doi:10.1145/1709093.1709094 · Cited by 45
The C standard formalized in Coq
Krebbers, R. (2015) · Radboud Repository (Radboud University) · Cited by 41
Self-citationA relational model of types-and-effects in higher-order concurrent separation logic
Krogh-Jespersen, M., Svendsen, K., & Birkedal, L. (2016) · doi:10.1145/3009837.3009877 · Cited by 29
Superficially substructural types
Krishnaswami, N. R., Turon, A. J., Dreyer, D. R., & Garg, D. (2012) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/2364527.2364536 · Cited by 28
Self-citationRefinement through restraint: bringing down the cost of verification
O’Connor, L., Chen, Z., Rizkallah, C., et al. (2016) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/2951913.2951940 · Cited by 26
The Design and Formalization of Mezzo, a Permission-Based Programming Language
Balabonski, T., Pottier, F., & Protzenko, J. (2016) · ACM Transactions on Programming Languages and Systems · doi:10.1145/2837022 · Cited by 25
Cited by
Iris from the ground up: A modular foundation for higher-order concurrent separation logic
JUNG, R., KREBBERS, R., JOURDAN, J.-H., BIZJAK, A., BIRKEDAL, L., & DREYER, D. (2018) · Journal of Functional Programming · doi:10.1017/s0956796818000151 · Cited by 372
Self-citationIdris 2: Quantitative Type Theory in Practice
Brady, E. (2021) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik · doi:10.4230/lipics.ecoop.2021.9 · Cited by 47
“An important mainstream example of the benefit of substructural type systems is Rust 4 [24] which guarantees memory safety of imperative programs without garbage collection or any run time overhead, and is expressive enough to implement session types [23].”
BackgroundExecutable formal semantics for the POSIX shell
Greenberg, M., & Blatt, A. J. (2020) · Proceedings of the ACM on Programming Languages · doi:10.1145/3371111 · Cited by 21
AutoVerus: Automated Proof Generation for Rust Code
Yang, C., Li, X., Misu, M. R. H., Yao, J., Cui, W., Gong, Y., Hawblitzel, C., Lahiri, S., Lorch, J. R., Lu, S., et al. (2025) · Proceedings of the ACM on Programming Languages · doi:10.1145/3763174 · Cited by 20
VerusSeek: Retrieval-Augmented LLM-Based Proof Synthesis for Rust Programs
Zhang, Y., Wen, C., Cao, J., Liu, D., Xu, Z., Liu, Y., & Qin, S. (2026) · Proceedings of the 41st IEEE/ACM International Conference on Automated Software Engineering · doi:10.1145/3832783.3834603
“Rust has been increasingly adopted for building reliable systems software because it provides memory-safety guarantees without sacrificing predictable performance [4, 5].”
Metadata
- Authors
- Jung, R., Jourdan, J.-H., Krebbers, R., & Dreyer, D.
- Venue
- Proceedings of the ACM on Programming Languages
- Published
- 2017-12-27
- Volume
- 2
- Issue
- POPL
- Pages
- 1-34
- ISSN
- 2475-1421 (ISSN-L)
- OpenAlex
- W2779850521
- Cited by
- 368
- References
- 43
- FWCI
- 13.45
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.