{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5UFPPO64TATVXZT7PHSP644Q6R","short_pith_number":"pith:5UFPPO64","schema_version":"1.0","canonical_sha256":"ed0af7bbdc98275be67f79e4ff7390f45600dcda57f16c3c9dbdff41b82307a3","source":{"kind":"arxiv","id":"1505.04533","version":1},"attestation_state":"computed","paper":{"title":"From Non-preemptive to Preemptive Scheduling using Synchronization Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Arjun Radhakrishna, Edmund M. Clarke, Leonid Ryzhyk, Pavol \\v{C}ern\\'y, Roopsha Samanta, Thomas A. Henzinger, Thorsten Tarrach","submitted_at":"2015-05-18T07:25:17Z","abstract_excerpt":"We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of calls that the program makes to an external interface. The specification requires that any such sequence produced under a preemptive scheduler should be included in the set of such sequences produced under"},"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":"1505.04533","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-05-18T07:25:17Z","cross_cats_sorted":[],"title_canon_sha256":"6626359745d5be2efd03d92cb55d10efe7d1ca6bf902b612ddb226f560a449ac","abstract_canon_sha256":"b858ad35adc23ae857c7a801423890682eeb8bb1cd30e96b266e5cbe5d355338"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:25.223584Z","signature_b64":"8jrAhc4qLuPW6Pso9psP11Ze+F6Xg1H5ehBtbKb40+EiCWtW6kEcu2uIv25rQQQeZGzySt6ByIDxG4cnaQSsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed0af7bbdc98275be67f79e4ff7390f45600dcda57f16c3c9dbdff41b82307a3","last_reissued_at":"2026-05-18T02:07:25.222822Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:25.222822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Non-preemptive to Preemptive Scheduling using Synchronization Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Arjun Radhakrishna, Edmund M. Clarke, Leonid Ryzhyk, Pavol \\v{C}ern\\'y, Roopsha Samanta, Thomas A. Henzinger, Thorsten Tarrach","submitted_at":"2015-05-18T07:25:17Z","abstract_excerpt":"We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of calls that the program makes to an external interface. The specification requires that any such sequence produced under a preemptive scheduler should be included in the set of such sequences produced under"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04533","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":"1505.04533","created_at":"2026-05-18T02:07:25.222942+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04533v1","created_at":"2026-05-18T02:07:25.222942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04533","created_at":"2026-05-18T02:07:25.222942+00:00"},{"alias_kind":"pith_short_12","alias_value":"5UFPPO64TATV","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"5UFPPO64TATVXZT7","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"5UFPPO64","created_at":"2026-05-18T12:29:07.941421+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/5UFPPO64TATVXZT7PHSP644Q6R","json":"https://pith.science/pith/5UFPPO64TATVXZT7PHSP644Q6R.json","graph_json":"https://pith.science/api/pith-number/5UFPPO64TATVXZT7PHSP644Q6R/graph.json","events_json":"https://pith.science/api/pith-number/5UFPPO64TATVXZT7PHSP644Q6R/events.json","paper":"https://pith.science/paper/5UFPPO64"},"agent_actions":{"view_html":"https://pith.science/pith/5UFPPO64TATVXZT7PHSP644Q6R","download_json":"https://pith.science/pith/5UFPPO64TATVXZT7PHSP644Q6R.json","view_paper":"https://pith.science/paper/5UFPPO64","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04533&json=true","fetch_graph":"https://pith.science/api/pith-number/5UFPPO64TATVXZT7PHSP644Q6R/graph.json","fetch_events":"https://pith.science/api/pith-number/5UFPPO64TATVXZT7PHSP644Q6R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5UFPPO64TATVXZT7PHSP644Q6R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5UFPPO64TATVXZT7PHSP644Q6R/action/storage_attestation","attest_author":"https://pith.science/pith/5UFPPO64TATVXZT7PHSP644Q6R/action/author_attestation","sign_citation":"https://pith.science/pith/5UFPPO64TATVXZT7PHSP644Q6R/action/citation_signature","submit_replication":"https://pith.science/pith/5UFPPO64TATVXZT7PHSP644Q6R/action/replication_record"}},"created_at":"2026-05-18T02:07:25.222942+00:00","updated_at":"2026-05-18T02:07:25.222942+00:00"}