{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6CNBBOAO35PPH3TMIPMIXYXFW7","short_pith_number":"pith:6CNBBOAO","schema_version":"1.0","canonical_sha256":"f09a10b80edf5ef3ee6c43d88be2e5b7c7586d97971bc79ee8322296ccb81987","source":{"kind":"arxiv","id":"1403.1749","version":1},"attestation_state":"computed","paper":{"title":"Automatically finding atomic regions for fixing bugs in Concurrent programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Akash Lal, Saurabh Joshi","submitted_at":"2014-03-07T13:46:25Z","abstract_excerpt":"This paper presents a technique for automatically constructing a fix for buggy concurrent programs: given a concurrent program that does not satisfy user-provided assertions, we infer atomic blocks that fix the program. An atomic block protects a piece of code and ensures that it runs without interruption from other threads. Our technique uses a verification tool as a subroutine to find the smallest atomic regions that remove all bugs in a given program. Keeping the atomic regions small allows for maximum concurrency. We have implemented our approach in a tool called AtomicInf. A user of Atomi"},"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":"1403.1749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2014-03-07T13:46:25Z","cross_cats_sorted":[],"title_canon_sha256":"ac4ba7a48cf84c4d66cd9c740377c6f91df61d26df6a21a1d52d969c87074723","abstract_canon_sha256":"065e0013591f5424786d1e9a798fad6839128de5486e5549ab1624e58a157ea7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:52.635890Z","signature_b64":"ppWsgV8qCkVNqZdOqmvwE/iPz6X7ghjsIIOw+HFY6Td6LNo4omH48Zxs1CIlmCB9VKSQ/Z75K+z4YjUwX2m0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f09a10b80edf5ef3ee6c43d88be2e5b7c7586d97971bc79ee8322296ccb81987","last_reissued_at":"2026-05-18T02:56:52.635327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:52.635327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatically finding atomic regions for fixing bugs in Concurrent programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Akash Lal, Saurabh Joshi","submitted_at":"2014-03-07T13:46:25Z","abstract_excerpt":"This paper presents a technique for automatically constructing a fix for buggy concurrent programs: given a concurrent program that does not satisfy user-provided assertions, we infer atomic blocks that fix the program. An atomic block protects a piece of code and ensures that it runs without interruption from other threads. Our technique uses a verification tool as a subroutine to find the smallest atomic regions that remove all bugs in a given program. Keeping the atomic regions small allows for maximum concurrency. We have implemented our approach in a tool called AtomicInf. A user of Atomi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1749","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":"1403.1749","created_at":"2026-05-18T02:56:52.635424+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.1749v1","created_at":"2026-05-18T02:56:52.635424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1749","created_at":"2026-05-18T02:56:52.635424+00:00"},{"alias_kind":"pith_short_12","alias_value":"6CNBBOAO35PP","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6CNBBOAO35PPH3TM","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6CNBBOAO","created_at":"2026-05-18T12:28:16.859392+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/6CNBBOAO35PPH3TMIPMIXYXFW7","json":"https://pith.science/pith/6CNBBOAO35PPH3TMIPMIXYXFW7.json","graph_json":"https://pith.science/api/pith-number/6CNBBOAO35PPH3TMIPMIXYXFW7/graph.json","events_json":"https://pith.science/api/pith-number/6CNBBOAO35PPH3TMIPMIXYXFW7/events.json","paper":"https://pith.science/paper/6CNBBOAO"},"agent_actions":{"view_html":"https://pith.science/pith/6CNBBOAO35PPH3TMIPMIXYXFW7","download_json":"https://pith.science/pith/6CNBBOAO35PPH3TMIPMIXYXFW7.json","view_paper":"https://pith.science/paper/6CNBBOAO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.1749&json=true","fetch_graph":"https://pith.science/api/pith-number/6CNBBOAO35PPH3TMIPMIXYXFW7/graph.json","fetch_events":"https://pith.science/api/pith-number/6CNBBOAO35PPH3TMIPMIXYXFW7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6CNBBOAO35PPH3TMIPMIXYXFW7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6CNBBOAO35PPH3TMIPMIXYXFW7/action/storage_attestation","attest_author":"https://pith.science/pith/6CNBBOAO35PPH3TMIPMIXYXFW7/action/author_attestation","sign_citation":"https://pith.science/pith/6CNBBOAO35PPH3TMIPMIXYXFW7/action/citation_signature","submit_replication":"https://pith.science/pith/6CNBBOAO35PPH3TMIPMIXYXFW7/action/replication_record"}},"created_at":"2026-05-18T02:56:52.635424+00:00","updated_at":"2026-05-18T02:56:52.635424+00:00"}