{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7WMQCO6O6VCLJCZVPMTGV6HWIJ","short_pith_number":"pith:7WMQCO6O","schema_version":"1.0","canonical_sha256":"fd99013bcef544b48b357b266af8f6427682863b186519a26a8ac070af4c5ce8","source":{"kind":"arxiv","id":"1207.7264","version":1},"attestation_state":"computed","paper":{"title":"Software Verification for Weak Memory via Program Transformation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.LO","authors_text":"Daniel Kroening, Jade Alglave, Michael Tautschnig, Vincent Nimal","submitted_at":"2012-07-30T09:17:23Z","abstract_excerpt":"Despite multiprocessors implementing weak memory models, verification methods often assume Sequential Consistency (SC), thus may miss bugs due to weak memory. We propose a sound transformation of the program to verify, enabling SC tools to perform verification w.r.t. weak memory. We present experiments for a broad variety of models (from x86/TSO to Power/ARM) and a vast range of verification tools, quantify the additional cost of the transformation and highlight the cases when we can drastically reduce it. Our benchmarks include work-queue management code from PostgreSQL."},"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":"1207.7264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-07-30T09:17:23Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"5debac081094bb4ad68879ab9b11c712e1b7a5497327df12eb028d13115eb6ca","abstract_canon_sha256":"59583aeed681c968e25d4322e212d1e55bca13ac3d45fc7c7a6c5466ed136e9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:46.362835Z","signature_b64":"4b/yJOkNuIvIETI84rB7zxswLplsS7HchN9p/93rntrC3RcXleycMCrplvWzPmJGuqdlLXl0xdyOiM09v0VGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd99013bcef544b48b357b266af8f6427682863b186519a26a8ac070af4c5ce8","last_reissued_at":"2026-05-18T03:49:46.361968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:46.361968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Software Verification for Weak Memory via Program Transformation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.LO","authors_text":"Daniel Kroening, Jade Alglave, Michael Tautschnig, Vincent Nimal","submitted_at":"2012-07-30T09:17:23Z","abstract_excerpt":"Despite multiprocessors implementing weak memory models, verification methods often assume Sequential Consistency (SC), thus may miss bugs due to weak memory. We propose a sound transformation of the program to verify, enabling SC tools to perform verification w.r.t. weak memory. We present experiments for a broad variety of models (from x86/TSO to Power/ARM) and a vast range of verification tools, quantify the additional cost of the transformation and highlight the cases when we can drastically reduce it. Our benchmarks include work-queue management code from PostgreSQL."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.7264","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":"1207.7264","created_at":"2026-05-18T03:49:46.362109+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.7264v1","created_at":"2026-05-18T03:49:46.362109+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.7264","created_at":"2026-05-18T03:49:46.362109+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WMQCO6O6VCL","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WMQCO6O6VCLJCZV","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WMQCO6O","created_at":"2026-05-18T12:26:58.693483+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/7WMQCO6O6VCLJCZVPMTGV6HWIJ","json":"https://pith.science/pith/7WMQCO6O6VCLJCZVPMTGV6HWIJ.json","graph_json":"https://pith.science/api/pith-number/7WMQCO6O6VCLJCZVPMTGV6HWIJ/graph.json","events_json":"https://pith.science/api/pith-number/7WMQCO6O6VCLJCZVPMTGV6HWIJ/events.json","paper":"https://pith.science/paper/7WMQCO6O"},"agent_actions":{"view_html":"https://pith.science/pith/7WMQCO6O6VCLJCZVPMTGV6HWIJ","download_json":"https://pith.science/pith/7WMQCO6O6VCLJCZVPMTGV6HWIJ.json","view_paper":"https://pith.science/paper/7WMQCO6O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.7264&json=true","fetch_graph":"https://pith.science/api/pith-number/7WMQCO6O6VCLJCZVPMTGV6HWIJ/graph.json","fetch_events":"https://pith.science/api/pith-number/7WMQCO6O6VCLJCZVPMTGV6HWIJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WMQCO6O6VCLJCZVPMTGV6HWIJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WMQCO6O6VCLJCZVPMTGV6HWIJ/action/storage_attestation","attest_author":"https://pith.science/pith/7WMQCO6O6VCLJCZVPMTGV6HWIJ/action/author_attestation","sign_citation":"https://pith.science/pith/7WMQCO6O6VCLJCZVPMTGV6HWIJ/action/citation_signature","submit_replication":"https://pith.science/pith/7WMQCO6O6VCLJCZVPMTGV6HWIJ/action/replication_record"}},"created_at":"2026-05-18T03:49:46.362109+00:00","updated_at":"2026-05-18T03:49:46.362109+00:00"}