{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TXNC7I6HNCOQCWGMRCOCU6UP6H","short_pith_number":"pith:TXNC7I6H","schema_version":"1.0","canonical_sha256":"9dda2fa3c7689d0158cc889c2a7a8ff1f43b6952a2023d7e8c14a05b197ef354","source":{"kind":"arxiv","id":"1803.06547","version":4},"attestation_state":"computed","paper":{"title":"Meta-F*: Proof Automation with SMT, Tactics, and Metaprograms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Aseem Rastogi, Catalin Hritcu, Chris Hawblitzel, Cl\\'ement Pit-Claudel, Danel Ahman, Guido Mart\\'inez, Jonathan Protzenko, Monal Narasimhamurthy, Nick Giannarakis, Nikhil Swamy, Tahina Ramananandro, Victor Dumitrescu, Zoe Paraskevopoulou","submitted_at":"2018-03-17T18:08:13Z","abstract_excerpt":"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.\n  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 th"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1803.06547","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2018-03-17T18:08:13Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"34751ea8fa9506142a4ae769a8912304235beb542782e2f0e34ab880c6bbf5d3","abstract_canon_sha256":"c6bc7aade72f5d41e9d172719ca4fa867ae5deba85e670a3b9c71b7197ce8a3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:54.655830Z","signature_b64":"66VWu/2IU0bW5r3/c2fGHlAfWdfBVt3t13QHNGsTd5ygHiOP+smPo60gqFkWqiuMOUlMV0+4vIiOlUb3NbxDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dda2fa3c7689d0158cc889c2a7a8ff1f43b6952a2023d7e8c14a05b197ef354","last_reissued_at":"2026-05-17T23:51:54.655307Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:54.655307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Meta-F*: Proof Automation with SMT, Tactics, and Metaprograms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Aseem Rastogi, Catalin Hritcu, Chris Hawblitzel, Cl\\'ement Pit-Claudel, Danel Ahman, Guido Mart\\'inez, Jonathan Protzenko, Monal Narasimhamurthy, Nick Giannarakis, Nikhil Swamy, Tahina Ramananandro, Victor Dumitrescu, Zoe Paraskevopoulou","submitted_at":"2018-03-17T18:08:13Z","abstract_excerpt":"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.\n  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 th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06547","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.06547","created_at":"2026-05-17T23:51:54.655397+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06547v4","created_at":"2026-05-17T23:51:54.655397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06547","created_at":"2026-05-17T23:51:54.655397+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXNC7I6HNCOQ","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXNC7I6HNCOQCWGM","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXNC7I6H","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TXNC7I6HNCOQCWGMRCOCU6UP6H","json":"https://pith.science/pith/TXNC7I6HNCOQCWGMRCOCU6UP6H.json","graph_json":"https://pith.science/api/pith-number/TXNC7I6HNCOQCWGMRCOCU6UP6H/graph.json","events_json":"https://pith.science/api/pith-number/TXNC7I6HNCOQCWGMRCOCU6UP6H/events.json","paper":"https://pith.science/paper/TXNC7I6H"},"agent_actions":{"view_html":"https://pith.science/pith/TXNC7I6HNCOQCWGMRCOCU6UP6H","download_json":"https://pith.science/pith/TXNC7I6HNCOQCWGMRCOCU6UP6H.json","view_paper":"https://pith.science/paper/TXNC7I6H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06547&json=true","fetch_graph":"https://pith.science/api/pith-number/TXNC7I6HNCOQCWGMRCOCU6UP6H/graph.json","fetch_events":"https://pith.science/api/pith-number/TXNC7I6HNCOQCWGMRCOCU6UP6H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXNC7I6HNCOQCWGMRCOCU6UP6H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXNC7I6HNCOQCWGMRCOCU6UP6H/action/storage_attestation","attest_author":"https://pith.science/pith/TXNC7I6HNCOQCWGMRCOCU6UP6H/action/author_attestation","sign_citation":"https://pith.science/pith/TXNC7I6HNCOQCWGMRCOCU6UP6H/action/citation_signature","submit_replication":"https://pith.science/pith/TXNC7I6HNCOQCWGMRCOCU6UP6H/action/replication_record"}},"created_at":"2026-05-17T23:51:54.655397+00:00","updated_at":"2026-05-17T23:51:54.655397+00:00"}