{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RU2B27HAZDDULCNWGZPA4GZ25I","short_pith_number":"pith:RU2B27HA","schema_version":"1.0","canonical_sha256":"8d341d7ce0c8c74589b6365e0e1b3aea3ae734c52c23456ad77e6f148035a86a","source":{"kind":"arxiv","id":"1509.03339","version":1},"attestation_state":"computed","paper":{"title":"A Formal C Memory Model for Separation Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Robbert Krebbers","submitted_at":"2015-09-10T21:16:41Z","abstract_excerpt":"The core of a formal semantics of an imperative programming language is a memory model that describes the behavior of operations on the memory. Defining a memory model that matches the description of C in the C11 standard is challenging because C allows both high-level (by means of typed expressions) and low-level (by means of bit manipulation) memory accesses. The C11 standard has restricted the interaction between these two levels to make more effective compiler optimizations possible, on the expense of making the memory model complicated.\n  We describe a formal memory model of the (non-conc"},"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":"1509.03339","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-09-10T21:16:41Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"79df2c7af47ba4793feccd6b741e5bff3e57fa9e6b992f6bb944f5326a42cf44","abstract_canon_sha256":"5af90b9bcc664ef94fcf8a8ca6dd0e20fb0af8f4a2a329a084b83dd27fae921c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:23.599787Z","signature_b64":"FkTs1K8hBW83vXPfUAxZx8+JAW0TW/eoN68z29QOcFrPnWiK38QKOCUvv8u8C6mGMbecWWrt6iY/vg9KbW7HCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d341d7ce0c8c74589b6365e0e1b3aea3ae734c52c23456ad77e6f148035a86a","last_reissued_at":"2026-05-18T01:33:23.599146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:23.599146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Formal C Memory Model for Separation Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Robbert Krebbers","submitted_at":"2015-09-10T21:16:41Z","abstract_excerpt":"The core of a formal semantics of an imperative programming language is a memory model that describes the behavior of operations on the memory. Defining a memory model that matches the description of C in the C11 standard is challenging because C allows both high-level (by means of typed expressions) and low-level (by means of bit manipulation) memory accesses. The C11 standard has restricted the interaction between these two levels to make more effective compiler optimizations possible, on the expense of making the memory model complicated.\n  We describe a formal memory model of the (non-conc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03339","kind":"arxiv","version":1},"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":"1509.03339","created_at":"2026-05-18T01:33:23.599248+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.03339v1","created_at":"2026-05-18T01:33:23.599248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03339","created_at":"2026-05-18T01:33:23.599248+00:00"},{"alias_kind":"pith_short_12","alias_value":"RU2B27HAZDDU","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RU2B27HAZDDULCNW","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RU2B27HA","created_at":"2026-05-18T12:29:39.896362+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/RU2B27HAZDDULCNWGZPA4GZ25I","json":"https://pith.science/pith/RU2B27HAZDDULCNWGZPA4GZ25I.json","graph_json":"https://pith.science/api/pith-number/RU2B27HAZDDULCNWGZPA4GZ25I/graph.json","events_json":"https://pith.science/api/pith-number/RU2B27HAZDDULCNWGZPA4GZ25I/events.json","paper":"https://pith.science/paper/RU2B27HA"},"agent_actions":{"view_html":"https://pith.science/pith/RU2B27HAZDDULCNWGZPA4GZ25I","download_json":"https://pith.science/pith/RU2B27HAZDDULCNWGZPA4GZ25I.json","view_paper":"https://pith.science/paper/RU2B27HA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.03339&json=true","fetch_graph":"https://pith.science/api/pith-number/RU2B27HAZDDULCNWGZPA4GZ25I/graph.json","fetch_events":"https://pith.science/api/pith-number/RU2B27HAZDDULCNWGZPA4GZ25I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RU2B27HAZDDULCNWGZPA4GZ25I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RU2B27HAZDDULCNWGZPA4GZ25I/action/storage_attestation","attest_author":"https://pith.science/pith/RU2B27HAZDDULCNWGZPA4GZ25I/action/author_attestation","sign_citation":"https://pith.science/pith/RU2B27HAZDDULCNWGZPA4GZ25I/action/citation_signature","submit_replication":"https://pith.science/pith/RU2B27HAZDDULCNWGZPA4GZ25I/action/replication_record"}},"created_at":"2026-05-18T01:33:23.599248+00:00","updated_at":"2026-05-18T01:33:23.599248+00:00"}