{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UEKRF4W3BBM4EFEYU4EKXW2WHH","short_pith_number":"pith:UEKRF4W3","schema_version":"1.0","canonical_sha256":"a11512f2db0859c21498a708abdb5639d314136c60c42369a3878c37fca0b46a","source":{"kind":"arxiv","id":"1606.05435","version":1},"attestation_state":"computed","paper":{"title":"Efficient Verification of Concurrent Programs Over TSO Memory Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Chinmay Narayan, S.Arun-Kumar, Subodh Sharma","submitted_at":"2016-06-17T07:47:02Z","abstract_excerpt":"We address the problem of efficient verification of multi-threaded programs running over Total Store Order (TSO) memory model. It has been shown that even with finite data domain programs, the complexity of control state reachability under TSO is non-primitive recursive. In this paper, we first present a bounded-buffer verification approach wherein a bound on the size of buffers is placed; verification is performed incrementally by increasing the size of the buffer with each iteration of the verification procedure until the said bound is reached. For programs operating on finite data domains, "},"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":"1606.05435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-06-17T07:47:02Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"d115a3c7a79fd0ccd12a84dfdb58024caf1e4e772075a0645162ad3f47e1fb18","abstract_canon_sha256":"09e51b96caf940ce65673c6d5f02860f4309b183b964d43c80ab8fb31bb9e019"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:19.560347Z","signature_b64":"xbgu1AJXCE97SFuAG57K1Jh7oIgkfeUDx4fJBjfr6t/yJaGVL7e3hwiNpVYqCWm/pdsOwX6UOAP5ET2K6UWqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a11512f2db0859c21498a708abdb5639d314136c60c42369a3878c37fca0b46a","last_reissued_at":"2026-05-18T01:12:19.559991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:19.559991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Verification of Concurrent Programs Over TSO Memory Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Chinmay Narayan, S.Arun-Kumar, Subodh Sharma","submitted_at":"2016-06-17T07:47:02Z","abstract_excerpt":"We address the problem of efficient verification of multi-threaded programs running over Total Store Order (TSO) memory model. It has been shown that even with finite data domain programs, the complexity of control state reachability under TSO is non-primitive recursive. In this paper, we first present a bounded-buffer verification approach wherein a bound on the size of buffers is placed; verification is performed incrementally by increasing the size of the buffer with each iteration of the verification procedure until the said bound is reached. For programs operating on finite data domains, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05435","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":"1606.05435","created_at":"2026-05-18T01:12:19.560045+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.05435v1","created_at":"2026-05-18T01:12:19.560045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05435","created_at":"2026-05-18T01:12:19.560045+00:00"},{"alias_kind":"pith_short_12","alias_value":"UEKRF4W3BBM4","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UEKRF4W3BBM4EFEY","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UEKRF4W3","created_at":"2026-05-18T12:30:46.583412+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/UEKRF4W3BBM4EFEYU4EKXW2WHH","json":"https://pith.science/pith/UEKRF4W3BBM4EFEYU4EKXW2WHH.json","graph_json":"https://pith.science/api/pith-number/UEKRF4W3BBM4EFEYU4EKXW2WHH/graph.json","events_json":"https://pith.science/api/pith-number/UEKRF4W3BBM4EFEYU4EKXW2WHH/events.json","paper":"https://pith.science/paper/UEKRF4W3"},"agent_actions":{"view_html":"https://pith.science/pith/UEKRF4W3BBM4EFEYU4EKXW2WHH","download_json":"https://pith.science/pith/UEKRF4W3BBM4EFEYU4EKXW2WHH.json","view_paper":"https://pith.science/paper/UEKRF4W3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.05435&json=true","fetch_graph":"https://pith.science/api/pith-number/UEKRF4W3BBM4EFEYU4EKXW2WHH/graph.json","fetch_events":"https://pith.science/api/pith-number/UEKRF4W3BBM4EFEYU4EKXW2WHH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UEKRF4W3BBM4EFEYU4EKXW2WHH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UEKRF4W3BBM4EFEYU4EKXW2WHH/action/storage_attestation","attest_author":"https://pith.science/pith/UEKRF4W3BBM4EFEYU4EKXW2WHH/action/author_attestation","sign_citation":"https://pith.science/pith/UEKRF4W3BBM4EFEYU4EKXW2WHH/action/citation_signature","submit_replication":"https://pith.science/pith/UEKRF4W3BBM4EFEYU4EKXW2WHH/action/replication_record"}},"created_at":"2026-05-18T01:12:19.560045+00:00","updated_at":"2026-05-18T01:12:19.560045+00:00"}