{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TESED2622NOH3XZWONTCPG7JKX","short_pith_number":"pith:TESED262","schema_version":"1.0","canonical_sha256":"992441ebdad35c7ddf367366279be955fc921019097b25d2b20d4d8d9672bc7c","source":{"kind":"arxiv","id":"1807.08117","version":1},"attestation_state":"computed","paper":{"title":"An Asynchronous soundness theorem for concurrent separation logic","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"L\\'eo Stefanesco, Paul-Andr\\'e Melli\\`es","submitted_at":"2018-07-21T10:01:36Z","abstract_excerpt":"Concurrent separation logic (CSL) is a specification logic for concurrent imperative programs with shared memory and locks. In this paper, we develop a concurrent and interactive account of the logic inspired by asynchronous game semantics. To every program $C$, we associate a pair of asynchronous transition systems $[C]_S$ and $[C]_L$ which describe the operational behavior of the Code when confronted to its Environment or Frame --- both at the level of machine states ($S$) and of machine instructions and locks ($L$). We then establish that every derivation tree $\\pi$ of a judgment $\\Gamma\\vd"},"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":"1807.08117","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2018-07-21T10:01:36Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"3ae0a6b8da1062c9c6ce1c0baf0a442f62f1a9fe251758573722863a255607f1","abstract_canon_sha256":"79bf6145305e150e1e179fd91c0d6abc855baf6fc5cda4cfb89e698e9274128e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:09.251512Z","signature_b64":"hjnMCOnmT7ByDqcseggSpdelchfUyH+v6MJr0kRgRkgoVood7V0aoI98n1M/zcpS3AjEPRMBBrklERiMAcKZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"992441ebdad35c7ddf367366279be955fc921019097b25d2b20d4d8d9672bc7c","last_reissued_at":"2026-05-18T00:10:09.250877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:09.250877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Asynchronous soundness theorem for concurrent separation logic","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"L\\'eo Stefanesco, Paul-Andr\\'e Melli\\`es","submitted_at":"2018-07-21T10:01:36Z","abstract_excerpt":"Concurrent separation logic (CSL) is a specification logic for concurrent imperative programs with shared memory and locks. In this paper, we develop a concurrent and interactive account of the logic inspired by asynchronous game semantics. To every program $C$, we associate a pair of asynchronous transition systems $[C]_S$ and $[C]_L$ which describe the operational behavior of the Code when confronted to its Environment or Frame --- both at the level of machine states ($S$) and of machine instructions and locks ($L$). We then establish that every derivation tree $\\pi$ of a judgment $\\Gamma\\vd"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08117","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":"1807.08117","created_at":"2026-05-18T00:10:09.251002+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.08117v1","created_at":"2026-05-18T00:10:09.251002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08117","created_at":"2026-05-18T00:10:09.251002+00:00"},{"alias_kind":"pith_short_12","alias_value":"TESED2622NOH","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TESED2622NOH3XZW","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TESED262","created_at":"2026-05-18T12:32:53.628368+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/TESED2622NOH3XZWONTCPG7JKX","json":"https://pith.science/pith/TESED2622NOH3XZWONTCPG7JKX.json","graph_json":"https://pith.science/api/pith-number/TESED2622NOH3XZWONTCPG7JKX/graph.json","events_json":"https://pith.science/api/pith-number/TESED2622NOH3XZWONTCPG7JKX/events.json","paper":"https://pith.science/paper/TESED262"},"agent_actions":{"view_html":"https://pith.science/pith/TESED2622NOH3XZWONTCPG7JKX","download_json":"https://pith.science/pith/TESED2622NOH3XZWONTCPG7JKX.json","view_paper":"https://pith.science/paper/TESED262","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.08117&json=true","fetch_graph":"https://pith.science/api/pith-number/TESED2622NOH3XZWONTCPG7JKX/graph.json","fetch_events":"https://pith.science/api/pith-number/TESED2622NOH3XZWONTCPG7JKX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TESED2622NOH3XZWONTCPG7JKX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TESED2622NOH3XZWONTCPG7JKX/action/storage_attestation","attest_author":"https://pith.science/pith/TESED2622NOH3XZWONTCPG7JKX/action/author_attestation","sign_citation":"https://pith.science/pith/TESED2622NOH3XZWONTCPG7JKX/action/citation_signature","submit_replication":"https://pith.science/pith/TESED2622NOH3XZWONTCPG7JKX/action/replication_record"}},"created_at":"2026-05-18T00:10:09.251002+00:00","updated_at":"2026-05-18T00:10:09.251002+00:00"}