{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2GAZH6JNDUDM2B2COL43PS6PMA","short_pith_number":"pith:2GAZH6JN","schema_version":"1.0","canonical_sha256":"d18193f92d1d06cd074272f9b7cbcf60338262c380554faf6f82d2858ce4d0c9","source":{"kind":"arxiv","id":"1501.02683","version":1},"attestation_state":"computed","paper":{"title":"Lazy TSO Reachability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Ahmed Bouajjani, Egor Derevenetc, Georgel Calin, Roland Meyer","submitted_at":"2015-01-12T15:50:07Z","abstract_excerpt":"We address the problem of checking state reachability for programs running under Total Store Order (TSO). The problem has been shown to be decidable but the cost is prohibitive, namely non-primitive recursive. We propose here to give up completeness. Our contribution is a new algorithm for TSO reachability: it uses the standard SC semantics and introduces the TSO semantics lazily and only where needed. At the heart of our algorithm is an iterative refinement of the program of interest. If the program's goal state is SC-reachable, we are done. If the goal state is not SC-reachable, this may be "},"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":"1501.02683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-01-12T15:50:07Z","cross_cats_sorted":[],"title_canon_sha256":"a9e60b06cacdd87f5ade5dc065c9c31cdbecc939e95b60bfc1466303e5b09277","abstract_canon_sha256":"12609f724df1ea5e98555533a9217519f6bd480a8e54f750b62c76fe3ffe27e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:37.487394Z","signature_b64":"svw9Ej19FN5tOGxt43LtYCio4CnCkJ1B7binvjPEzFB38qVDbnjW5djdWQSwGOqxrQcgITWTfnk/IwaOYDj9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d18193f92d1d06cd074272f9b7cbcf60338262c380554faf6f82d2858ce4d0c9","last_reissued_at":"2026-05-18T02:29:37.486986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:37.486986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lazy TSO Reachability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Ahmed Bouajjani, Egor Derevenetc, Georgel Calin, Roland Meyer","submitted_at":"2015-01-12T15:50:07Z","abstract_excerpt":"We address the problem of checking state reachability for programs running under Total Store Order (TSO). The problem has been shown to be decidable but the cost is prohibitive, namely non-primitive recursive. We propose here to give up completeness. Our contribution is a new algorithm for TSO reachability: it uses the standard SC semantics and introduces the TSO semantics lazily and only where needed. At the heart of our algorithm is an iterative refinement of the program of interest. If the program's goal state is SC-reachable, we are done. If the goal state is not SC-reachable, this may be "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02683","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":"1501.02683","created_at":"2026-05-18T02:29:37.487049+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.02683v1","created_at":"2026-05-18T02:29:37.487049+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02683","created_at":"2026-05-18T02:29:37.487049+00:00"},{"alias_kind":"pith_short_12","alias_value":"2GAZH6JNDUDM","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2GAZH6JNDUDM2B2C","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2GAZH6JN","created_at":"2026-05-18T12:28:59.999130+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/2GAZH6JNDUDM2B2COL43PS6PMA","json":"https://pith.science/pith/2GAZH6JNDUDM2B2COL43PS6PMA.json","graph_json":"https://pith.science/api/pith-number/2GAZH6JNDUDM2B2COL43PS6PMA/graph.json","events_json":"https://pith.science/api/pith-number/2GAZH6JNDUDM2B2COL43PS6PMA/events.json","paper":"https://pith.science/paper/2GAZH6JN"},"agent_actions":{"view_html":"https://pith.science/pith/2GAZH6JNDUDM2B2COL43PS6PMA","download_json":"https://pith.science/pith/2GAZH6JNDUDM2B2COL43PS6PMA.json","view_paper":"https://pith.science/paper/2GAZH6JN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.02683&json=true","fetch_graph":"https://pith.science/api/pith-number/2GAZH6JNDUDM2B2COL43PS6PMA/graph.json","fetch_events":"https://pith.science/api/pith-number/2GAZH6JNDUDM2B2COL43PS6PMA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2GAZH6JNDUDM2B2COL43PS6PMA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2GAZH6JNDUDM2B2COL43PS6PMA/action/storage_attestation","attest_author":"https://pith.science/pith/2GAZH6JNDUDM2B2COL43PS6PMA/action/author_attestation","sign_citation":"https://pith.science/pith/2GAZH6JNDUDM2B2COL43PS6PMA/action/citation_signature","submit_replication":"https://pith.science/pith/2GAZH6JNDUDM2B2COL43PS6PMA/action/replication_record"}},"created_at":"2026-05-18T02:29:37.487049+00:00","updated_at":"2026-05-18T02:29:37.487049+00:00"}