{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6UE6GGEBQQA3PBB7ADC4ZCUMOG","short_pith_number":"pith:6UE6GGEB","schema_version":"1.0","canonical_sha256":"f509e318818401b7843f00c5cc8a8c719a321aafebca781586828a1c21948981","source":{"kind":"arxiv","id":"2403.15122","version":3},"attestation_state":"computed","paper":{"title":"A Hybrid Approach to Semi-automated Rust Verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Petar Maksimovi\\'c, Philippa Gardner, Sacha-\\'Elie Ayoun, Xavier Denis","submitted_at":"2024-03-22T11:24:31Z","abstract_excerpt":"We propose a hybrid approach to end-to-end Rust verification where the proof effort is split into powerful automated verification of safe Rust and targeted semi-automated verification of unsafe Rust. To this end, we present Gillian-Rust, a proof-of-concept semi-automated verification tool built on top of the Gillian platform that can reason about type safety and functional correctness of unsafe code. Gillian-Rust automates a rich separation logic for real-world Rust, embedding the lifetime logic of RustBelt and the parametric prophecies of RustHornBelt, and is able to verify real-world Rust st"},"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":"2403.15122","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2024-03-22T11:24:31Z","cross_cats_sorted":[],"title_canon_sha256":"4636b59ced8b2e4cf502952eaff22a2e9591414f1ac7dd66aa1a7c0692e9de06","abstract_canon_sha256":"7cec6e0756ce58126a96f0e6cd166dfef1a13079a39b3c08bea1c6b7c6dabab0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:46:53.748522Z","signature_b64":"i7aB01ExxZ7WBCyZZ6XZgXDgkt+s+b6J4N/rz0KALAnb5wYaWU1+BPsDDNdyLERYbjv0WWiyGGkm1asWvPscAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f509e318818401b7843f00c5cc8a8c719a321aafebca781586828a1c21948981","last_reissued_at":"2026-07-05T10:46:53.748076Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:46:53.748076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Hybrid Approach to Semi-automated Rust Verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Petar Maksimovi\\'c, Philippa Gardner, Sacha-\\'Elie Ayoun, Xavier Denis","submitted_at":"2024-03-22T11:24:31Z","abstract_excerpt":"We propose a hybrid approach to end-to-end Rust verification where the proof effort is split into powerful automated verification of safe Rust and targeted semi-automated verification of unsafe Rust. To this end, we present Gillian-Rust, a proof-of-concept semi-automated verification tool built on top of the Gillian platform that can reason about type safety and functional correctness of unsafe code. Gillian-Rust automates a rich separation logic for real-world Rust, embedding the lifetime logic of RustBelt and the parametric prophecies of RustHornBelt, and is able to verify real-world Rust st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.15122","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.15122/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2403.15122","created_at":"2026-07-05T10:46:53.748133+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.15122v3","created_at":"2026-07-05T10:46:53.748133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.15122","created_at":"2026-07-05T10:46:53.748133+00:00"},{"alias_kind":"pith_short_12","alias_value":"6UE6GGEBQQA3","created_at":"2026-07-05T10:46:53.748133+00:00"},{"alias_kind":"pith_short_16","alias_value":"6UE6GGEBQQA3PBB7","created_at":"2026-07-05T10:46:53.748133+00:00"},{"alias_kind":"pith_short_8","alias_value":"6UE6GGEB","created_at":"2026-07-05T10:46:53.748133+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.08729","citing_title":"Soteria: Efficient Symbolic Execution as a Functional Library","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6UE6GGEBQQA3PBB7ADC4ZCUMOG","json":"https://pith.science/pith/6UE6GGEBQQA3PBB7ADC4ZCUMOG.json","graph_json":"https://pith.science/api/pith-number/6UE6GGEBQQA3PBB7ADC4ZCUMOG/graph.json","events_json":"https://pith.science/api/pith-number/6UE6GGEBQQA3PBB7ADC4ZCUMOG/events.json","paper":"https://pith.science/paper/6UE6GGEB"},"agent_actions":{"view_html":"https://pith.science/pith/6UE6GGEBQQA3PBB7ADC4ZCUMOG","download_json":"https://pith.science/pith/6UE6GGEBQQA3PBB7ADC4ZCUMOG.json","view_paper":"https://pith.science/paper/6UE6GGEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.15122&json=true","fetch_graph":"https://pith.science/api/pith-number/6UE6GGEBQQA3PBB7ADC4ZCUMOG/graph.json","fetch_events":"https://pith.science/api/pith-number/6UE6GGEBQQA3PBB7ADC4ZCUMOG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6UE6GGEBQQA3PBB7ADC4ZCUMOG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6UE6GGEBQQA3PBB7ADC4ZCUMOG/action/storage_attestation","attest_author":"https://pith.science/pith/6UE6GGEBQQA3PBB7ADC4ZCUMOG/action/author_attestation","sign_citation":"https://pith.science/pith/6UE6GGEBQQA3PBB7ADC4ZCUMOG/action/citation_signature","submit_replication":"https://pith.science/pith/6UE6GGEBQQA3PBB7ADC4ZCUMOG/action/replication_record"}},"created_at":"2026-07-05T10:46:53.748133+00:00","updated_at":"2026-07-05T10:46:53.748133+00:00"}