{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4OZRXYJC35E6CS3JUETFCCKO57","short_pith_number":"pith:4OZRXYJC","schema_version":"1.0","canonical_sha256":"e3b31be122df49e14b69a12651094eefc48bd2370288d6c044208de243888291","source":{"kind":"arxiv","id":"1703.06368","version":2},"attestation_state":"computed","paper":{"title":"Automating Deductive Verification for Weak-Memory Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Alexander J. Summers, Peter M\\\"uller","submitted_at":"2017-03-18T23:51:15Z","abstract_excerpt":"Writing correct programs for weak memory models such as the C11 memory model is challenging because of the weak consistency guarantees these models provide. The first program logics for the verification of such programs have recently been proposed, but their usage has been limited thus far to manual proofs. Automating proofs in these logics via first-order solvers is non-trivial, due to reasoning features such as higher-order assertions, modalities and rich permission resources. In this paper, we provide the first implementation of a weak memory program logic using existing deductive verificat"},"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":"1703.06368","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-03-18T23:51:15Z","cross_cats_sorted":[],"title_canon_sha256":"509c73da3887a780bc996caccfa027771b85691054c0da809bb2cdaad2b5e61b","abstract_canon_sha256":"4b2111ffdef68ff3b6c46f0ba1749d73707e731ef26abd399fbf51f631263a6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:09.065435Z","signature_b64":"Kbk6GIC6/9+fT8tNY8TiLEce9pTcZJBsmEJLHbe3nCfDA7B6dr+vGmqbe4r7o61ULKH+ZqULYC2M7tHjgZjUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3b31be122df49e14b69a12651094eefc48bd2370288d6c044208de243888291","last_reissued_at":"2026-05-18T00:23:09.064860Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:09.064860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automating Deductive Verification for Weak-Memory Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Alexander J. Summers, Peter M\\\"uller","submitted_at":"2017-03-18T23:51:15Z","abstract_excerpt":"Writing correct programs for weak memory models such as the C11 memory model is challenging because of the weak consistency guarantees these models provide. The first program logics for the verification of such programs have recently been proposed, but their usage has been limited thus far to manual proofs. Automating proofs in these logics via first-order solvers is non-trivial, due to reasoning features such as higher-order assertions, modalities and rich permission resources. In this paper, we provide the first implementation of a weak memory program logic using existing deductive verificat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06368","kind":"arxiv","version":2},"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":"1703.06368","created_at":"2026-05-18T00:23:09.064941+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.06368v2","created_at":"2026-05-18T00:23:09.064941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06368","created_at":"2026-05-18T00:23:09.064941+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OZRXYJC35E6","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OZRXYJC35E6CS3J","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OZRXYJC","created_at":"2026-05-18T12:31:00.734936+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/4OZRXYJC35E6CS3JUETFCCKO57","json":"https://pith.science/pith/4OZRXYJC35E6CS3JUETFCCKO57.json","graph_json":"https://pith.science/api/pith-number/4OZRXYJC35E6CS3JUETFCCKO57/graph.json","events_json":"https://pith.science/api/pith-number/4OZRXYJC35E6CS3JUETFCCKO57/events.json","paper":"https://pith.science/paper/4OZRXYJC"},"agent_actions":{"view_html":"https://pith.science/pith/4OZRXYJC35E6CS3JUETFCCKO57","download_json":"https://pith.science/pith/4OZRXYJC35E6CS3JUETFCCKO57.json","view_paper":"https://pith.science/paper/4OZRXYJC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.06368&json=true","fetch_graph":"https://pith.science/api/pith-number/4OZRXYJC35E6CS3JUETFCCKO57/graph.json","fetch_events":"https://pith.science/api/pith-number/4OZRXYJC35E6CS3JUETFCCKO57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OZRXYJC35E6CS3JUETFCCKO57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OZRXYJC35E6CS3JUETFCCKO57/action/storage_attestation","attest_author":"https://pith.science/pith/4OZRXYJC35E6CS3JUETFCCKO57/action/author_attestation","sign_citation":"https://pith.science/pith/4OZRXYJC35E6CS3JUETFCCKO57/action/citation_signature","submit_replication":"https://pith.science/pith/4OZRXYJC35E6CS3JUETFCCKO57/action/replication_record"}},"created_at":"2026-05-18T00:23:09.064941+00:00","updated_at":"2026-05-18T00:23:09.064941+00:00"}