{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VINRABRHEOU7I5LSGS6PXDPEPK","short_pith_number":"pith:VINRABRH","schema_version":"1.0","canonical_sha256":"aa1b10062723a9f4757234bcfb8de47ab0dcf8954c9261c179345b04b28f38a2","source":{"kind":"arxiv","id":"1208.6152","version":2},"attestation_state":"computed","paper":{"title":"Checking Robustness against TSO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Ahmed Bouajjani, Egor Derevenetc, Roland Meyer","submitted_at":"2012-08-30T12:32:01Z","abstract_excerpt":"We present algorithms for checking and enforcing robustness of concurrent programs against the Total Store Ordering (TSO) memory model. A program is robust if all its TSO computations correspond to computations under the Sequential Consistency (SC) semantics.\n  We provide a complete characterization of non-robustness in terms of so-called attacks: a restricted form of (harmful) out-of-program-order executions. Then, we show that detecting attacks can be parallelized, and can be solved using state reachability queries under SC semantics in a suitably instrumented program obtained by a linear si"},"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":"1208.6152","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-08-30T12:32:01Z","cross_cats_sorted":[],"title_canon_sha256":"012d91814232bc9cc9e24ffa745ad1ef1f068209874288b82c109457a3ff1870","abstract_canon_sha256":"c13c531c6de24a8bb6a2493b62b82b58843676507f1eeac3265a413e746ee3b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:11.015285Z","signature_b64":"4WTzMtMvE5MAz6iqWENmPYHzjUe5snZwKaJfIQTHDSBqLAr+2zp/PyFLnb2wBLz7SyIUoT/EpPAMnDIlhx3+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa1b10062723a9f4757234bcfb8de47ab0dcf8954c9261c179345b04b28f38a2","last_reissued_at":"2026-05-18T03:42:11.014524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:11.014524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Checking Robustness against TSO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Ahmed Bouajjani, Egor Derevenetc, Roland Meyer","submitted_at":"2012-08-30T12:32:01Z","abstract_excerpt":"We present algorithms for checking and enforcing robustness of concurrent programs against the Total Store Ordering (TSO) memory model. A program is robust if all its TSO computations correspond to computations under the Sequential Consistency (SC) semantics.\n  We provide a complete characterization of non-robustness in terms of so-called attacks: a restricted form of (harmful) out-of-program-order executions. Then, we show that detecting attacks can be parallelized, and can be solved using state reachability queries under SC semantics in a suitably instrumented program obtained by a linear si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.6152","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":"1208.6152","created_at":"2026-05-18T03:42:11.014624+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.6152v2","created_at":"2026-05-18T03:42:11.014624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.6152","created_at":"2026-05-18T03:42:11.014624+00:00"},{"alias_kind":"pith_short_12","alias_value":"VINRABRHEOU7","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VINRABRHEOU7I5LS","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VINRABRH","created_at":"2026-05-18T12:27:25.539911+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/VINRABRHEOU7I5LSGS6PXDPEPK","json":"https://pith.science/pith/VINRABRHEOU7I5LSGS6PXDPEPK.json","graph_json":"https://pith.science/api/pith-number/VINRABRHEOU7I5LSGS6PXDPEPK/graph.json","events_json":"https://pith.science/api/pith-number/VINRABRHEOU7I5LSGS6PXDPEPK/events.json","paper":"https://pith.science/paper/VINRABRH"},"agent_actions":{"view_html":"https://pith.science/pith/VINRABRHEOU7I5LSGS6PXDPEPK","download_json":"https://pith.science/pith/VINRABRHEOU7I5LSGS6PXDPEPK.json","view_paper":"https://pith.science/paper/VINRABRH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.6152&json=true","fetch_graph":"https://pith.science/api/pith-number/VINRABRHEOU7I5LSGS6PXDPEPK/graph.json","fetch_events":"https://pith.science/api/pith-number/VINRABRHEOU7I5LSGS6PXDPEPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VINRABRHEOU7I5LSGS6PXDPEPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VINRABRHEOU7I5LSGS6PXDPEPK/action/storage_attestation","attest_author":"https://pith.science/pith/VINRABRHEOU7I5LSGS6PXDPEPK/action/author_attestation","sign_citation":"https://pith.science/pith/VINRABRHEOU7I5LSGS6PXDPEPK/action/citation_signature","submit_replication":"https://pith.science/pith/VINRABRHEOU7I5LSGS6PXDPEPK/action/replication_record"}},"created_at":"2026-05-18T03:42:11.014624+00:00","updated_at":"2026-05-18T03:42:11.014624+00:00"}