{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UJHJW6H26IVNOGRMGMLO374ZM7","short_pith_number":"pith:UJHJW6H2","schema_version":"1.0","canonical_sha256":"a24e9b78faf22ad71a2c3316edff9967e35fa5bd42d5e34197b9cc09607fb231","source":{"kind":"arxiv","id":"1811.09143","version":1},"attestation_state":"computed","paper":{"title":"Verifying C11 Programs Operationally","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PL","authors_text":"Brijesh Dongol, Heike Wehrheim, John Derrick, Simon Doherty","submitted_at":"2018-11-22T12:47:18Z","abstract_excerpt":"This paper develops an operational semantics for a release-acquire fragment of the C11 memory model with relaxed accesses. We show that the semantics is both sound and complete with respect to the axiomatic model. The semantics relies on a per-thread notion of observability, which allows one to reason about a weak memory C11 program in program order. On top of this, we develop a proof calculus for invariant-based reasoning, which we use to verify the release-acquire version of Peterson's mutual exclusion algorithm."},"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":"1811.09143","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-11-22T12:47:18Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"af4589d09853e91a91c61c4f4e08d29c8744b738ea4de00fbc964552cbdfd1ee","abstract_canon_sha256":"6ed7db3a8c0163ab73ea0f5cd49f1f937dd659050eebce34ce165394dc39fd7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:06.928689Z","signature_b64":"6emP20ld6LumKUFH7Gt3VGocwZmPSdRwqc60H0P46dl4xUhZ+iXcvG7qQbBMpAoDjaGcSfyQHUPiS+SJj+z1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a24e9b78faf22ad71a2c3316edff9967e35fa5bd42d5e34197b9cc09607fb231","last_reissued_at":"2026-05-18T00:00:06.928027Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:06.928027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Verifying C11 Programs Operationally","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PL","authors_text":"Brijesh Dongol, Heike Wehrheim, John Derrick, Simon Doherty","submitted_at":"2018-11-22T12:47:18Z","abstract_excerpt":"This paper develops an operational semantics for a release-acquire fragment of the C11 memory model with relaxed accesses. We show that the semantics is both sound and complete with respect to the axiomatic model. The semantics relies on a per-thread notion of observability, which allows one to reason about a weak memory C11 program in program order. On top of this, we develop a proof calculus for invariant-based reasoning, which we use to verify the release-acquire version of Peterson's mutual exclusion algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09143","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":"1811.09143","created_at":"2026-05-18T00:00:06.928128+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.09143v1","created_at":"2026-05-18T00:00:06.928128+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09143","created_at":"2026-05-18T00:00:06.928128+00:00"},{"alias_kind":"pith_short_12","alias_value":"UJHJW6H26IVN","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UJHJW6H26IVNOGRM","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UJHJW6H2","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/UJHJW6H26IVNOGRMGMLO374ZM7","json":"https://pith.science/pith/UJHJW6H26IVNOGRMGMLO374ZM7.json","graph_json":"https://pith.science/api/pith-number/UJHJW6H26IVNOGRMGMLO374ZM7/graph.json","events_json":"https://pith.science/api/pith-number/UJHJW6H26IVNOGRMGMLO374ZM7/events.json","paper":"https://pith.science/paper/UJHJW6H2"},"agent_actions":{"view_html":"https://pith.science/pith/UJHJW6H26IVNOGRMGMLO374ZM7","download_json":"https://pith.science/pith/UJHJW6H26IVNOGRMGMLO374ZM7.json","view_paper":"https://pith.science/paper/UJHJW6H2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.09143&json=true","fetch_graph":"https://pith.science/api/pith-number/UJHJW6H26IVNOGRMGMLO374ZM7/graph.json","fetch_events":"https://pith.science/api/pith-number/UJHJW6H26IVNOGRMGMLO374ZM7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UJHJW6H26IVNOGRMGMLO374ZM7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UJHJW6H26IVNOGRMGMLO374ZM7/action/storage_attestation","attest_author":"https://pith.science/pith/UJHJW6H26IVNOGRMGMLO374ZM7/action/author_attestation","sign_citation":"https://pith.science/pith/UJHJW6H26IVNOGRMGMLO374ZM7/action/citation_signature","submit_replication":"https://pith.science/pith/UJHJW6H26IVNOGRMGMLO374ZM7/action/replication_record"}},"created_at":"2026-05-18T00:00:06.928128+00:00","updated_at":"2026-05-18T00:00:06.928128+00:00"}