Skip to Main content Skip to Navigation
Conference papers

Meta-F*: Proof automation with SMT, Tactics, and Metaprograms

Abstract : We introduce Meta-F⋆, a tactics and metaprogramming framework for the F⋆ program verifier. The main novelty of Meta-F⋆ is allowing the use of tactics and metaprogramming to discharge assertions not solvable by SMT, or to just simplify them into well-behaved SMT fragments. Plus, Meta-F⋆ can be used to generate verified code automatically. Meta-F⋆ is implemented as an F⋆ effect, which, given the powerful effect system of F⋆, heavily increases code reuse and even enables the lightweight verification of metaprograms. Metaprograms can be either interpreted, or compiled to efficient native code that can be dynamically loaded into the F⋆ type-checker and can interoperate with interpreted code. Evaluation on realistic case studies shows that Meta-F⋆ provides substantial gains in proof development, efficiency, and robustness.
Document type :
Conference papers
Complete list of metadatas
Contributor : Cătălin Hriţcu <>
Submitted on : Saturday, January 26, 2019 - 4:08:40 PM
Last modification on : Tuesday, September 1, 2020 - 2:49:57 PM

Links full text




Guido Martínez, Danel Ahman, Victor Dumitrescu, Nick Giannarakis, Chris Hawblitzel, et al.. Meta-F*: Proof automation with SMT, Tactics, and Metaprograms. ESOP'19 - European Symposium on Programming, Apr 2019, Prague, Czech Republic. ⟨10.1007/978-3-030-17184-1_2⟩. ⟨hal-01995376⟩



Record views