The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Dependent types and multi-monadic effects in F*
Open accessAbstract
We present a new, completely redesigned, version of F*, a language that works both as a proof assistant as well as a general-purpose, verification-oriented, effectful programming language. In support of these complementary roles, F* is a dependently typed, higher-order, call-by-value language with _primitive_ effects including state, exceptions, divergence and IO. Although primitive, programmers choose the granularity at which to specify effects by equipping each effect with a monadic, predicate transformer semantics. F* uses this to efficiently compute weakest preconditions and discharges the resulting proof obligations using a combination of SMT solving and manual proofs. Isolated from the effects, the core of F* is a language of pure functions used to write specifications and proof terms---its consistency is maintained by a semantic termination check based on a well-founded order. We evaluate our design on more than 55,000 lines of F* we have authored in the last year, focusing on three main case studies. Showcasing its use as a general-purpose programming language, F* is programmed (but not verified) in F*, and bootstraps in both OCaml and F#. Our experience confirms F*'s pay-as-you-go cost model: writing idiomatic ML-like code with no finer specifications imposes no user burden. As a verification-oriented language, our most significant evaluation of F* is in verifying several key modules in an implementation of the TLS-1.2 protocol standard. For the modules we considered, we are able to prove more properties, with fewer annotations using F* than in a prior verified implementation of TLS-1.2. Finally, as a proof assistant, we discuss our use of F* in mechanizing the metatheory of a range of lambda calculi, starting from the simply typed lambda calculus to System F-omega and even micro-F*, a sizeable fragment of F* itself---these proofs make essential use of F*'s flexible combination of SMT automation and constructive proofs, enabling a tactic-free style of programming and proving at a relatively large scale.
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
The Transport Layer Security (TLS) Protocol Version 1.1
Dierks, T., & Rescorla, E. (2006) · doi:10.17487/rfc4346 · Cited by 2,278
Guarded commands, nondeterminacy and formal derivation of programs
Dijkstra, E. W. (1975) · Communications of the ACM · doi:10.1145/360933.360975 · Cited by 1,941
The Transport Layer Security (TLS) Protocol Version 1.2
Dierks, T., & Rescorla, E. (2008) · doi:10.17487/rfc5246 · Cited by 1,576
Implementing Mathematics with The Nuprl Proof Development System
Constable, R. L., Allen, S. F., Bromley, H. M., Cleaveland, W. R., Cremer, J. F., Harper, R. W., Howe, D. J., Knoblock, T. B., Mendler, N. P., Panangaden, P., et al. (1986) · Cited by 985
Dafny: An Automatic Program Verifier for Functional Correctness
Leino, K. R. M. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17511-4_20 · Cited by 940 · cited 7×
“Our online tutorial provides a detailed example illustrating the problem, which is not unique to our system but also affects tools like Dafny (Leino 2010) that adopt a similar, flat memory model.”
InfluentialComputational lambda-calculus and monads
Moggi, E. (2003) · [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science · doi:10.1109/lics.1989.39155 · Cited by 842
Region-Based Memory Management
Tofte, M., & Talpin, J.-P. (1997) · Information and Computation · doi:10.1006/inco.1996.2613 · Cited by 615
Towards a practical programming language based on dependent type theory
Norell, U. (2007) · Cited by 555
Why3 — Where Programs Meet Provers
Filliâtre, J.-C., & Paskevich, A. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-37036-6_8 · Cited by 538
Towards a Mathematical Science of Computation
McCarthy, J. (1993) · Studies in Cognitive Systems · doi:10.1007/978-94-011-1793-7_2 · Cited by 525
Authenticated-encryption with associated-data
Rogaway, P. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586125 · Cited by 467
Freeman, T., & Pfenning, F. (1991) · Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation - PLDI '91 · doi:10.1145/113445.113468 · Cited by 424
Report on the programming language Euclid
Lampson, B., Horning, J. J., London, R. L., Mitchell, J. G., & Popek, G. J. (1977) · ACM SIGPLAN Notices · doi:10.1145/954666.971189 · Cited by 385
Vazou, N., Seidel, E. L., Jhala, R., Vytiniotis, D., & Jones, S. (2014) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/2628136.2628161 · Cited by 288
Cayenne—a language with dependent types
Augustsson, L. (1998) · Proceedings of the third ACM SIGPLAN international conference on Functional programming · doi:10.1145/289423.289451 · Cited by 286
Practical Foundations for Programming Languages
Harper, R. (2012) · Cambridge University Press eBooks · doi:10.1017/cbo9781139342131 · Cited by 182
Implementing TLS with Verified Cryptographic Security
Bhargavan, K., Fournet, C., Kohlweiss, M., Pironti, A., & Strub, P. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.37 · Cited by 178
Self-citationMonadic Presentations of Lambda Terms Using Generalized Inductive Types
Altenkirch, T., & Reus, B. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48168-0_32 · Cited by 155
Parameterised notions of computation
Atkey, R. (2009) · Journal of Functional Programming · doi:10.1017/s095679680900728x · Cited by 148
Hoare type theory, polymorphism and separation
Nanevski, A., Morrisett, G., & Birkedal, L. (2008) · Journal of Functional Programming · doi:10.1017/s0956796808006953 · Cited by 137
Combining programming with theorem proving
Chen, C., & Xi, H. (2005) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/1086365.1086375 · Cited by 120
Verifying higher-order programs with the dijkstra monad
Swamy, N., Weinberger, J., Schlesinger, C., et al. (2013) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2491956.2491978 · Cited by 113
Self-citationProgramming and reasoning with algebraic effects and dependent types
Brady, E. C. (2013) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/2500365.2500581 · Cited by 113
Modular verification of security protocol code by typing
Bhargavan, K., Fournet, C., & Gordon, A. D. (2010) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1706299.1706350 · Cited by 107
Self-citationSecure distributed programming with value-dependent types
Swamy, N., Chen, J., Fournet, C., Strub, P.-Y., Bhargavan, K., & Yang, J. (2013) · Journal of Functional Programming · doi:10.1017/s0956796813000142 · Cited by 71
Self-citationAutosubst: Reasoning with de Bruijn Terms and Parallel Substitutions
Schäfer, S., Tebbi, T., & Smolka, G. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-22102-1_24 · Cited by 59
foetus -- Termination Checker for Simple Functional ProgramsPreprint
Abel, A. M. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2407.06924 · Cited by 17
Cited by
A Survey of Attacks on Ethereum Smart Contracts (SoK)
Atzei, N., Bartoletti, M., & Cimoli, T. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-54455-6_8 · Cited by 1,553
An overview on smart contracts: Challenges, advances and platforms
Zheng, Z., Xie, S., Dai, H.-N., Chen, W., Chen, X., Weng, J., & Imran, M. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2019.12.019 · Cited by 1,197
ContractFuzzer: fuzzing smart contracts for vulnerability detection
Jiang, B., Liu, Y., & Chan, W. K. (2018) · Proceedings of the 33rd ACM/IEEE International Conference on Automated Software Engineering · doi:10.1145/3238147.3238177 · Cited by 820
Formal Verification of Smart Contracts: Short Paper
Bhargavan, K., Delignat-Lavaud, A., Fournet, C., Gollamudi, A., Gonthier, G., Kobeissi, N., Kulatova, N., Rastogi, A., Sibut-Pinote, T., Swamy, N., et al. (2016) · Proceedings of the 2016 ACM Workshop on Programming Languages and Analysis for Security · doi:10.1145/2993600.2993611 · Cited by 626
Self-citationSmart contract applications within blockchain technology: a systematic mapping study
Macrinici, D., Cartofeanu, C., & Gao, S. (2018) · Telematics and Informatics · doi:10.1016/j.tele.2018.10.004 · Cited by 458
Metadata
- Authors
- Swamy, N., Hriţcu, C., Keller, C., Rastogi, A., Delignat-Lavaud, A., Forest, S., Bhargavan, K., Fournet, C., Strub, P.-Y., Kohlweiss, M., Zinzindohoue, J.-K., & Zanella-Béguelin, S.
- Venue
- Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
- Publisher
- ACM
- Published
- 2016-01-11
- Pages
- 256-270
- OpenAlex
- W2267469130
- Cited by
- 314
- References
- 27
- FWCI
- 20.69
- Type
- conference paper
- Language
- en
- Open access
- green
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.