{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:ATUBFEYHTOPS74BWFMNMDPDZEV","short_pith_number":"pith:ATUBFEYH","schema_version":"1.0","canonical_sha256":"04e81293079b9f2ff0362b1ac1bc79256e7fc6a7af1c9e1f0ae3495f6e96e4cd","source":{"kind":"arxiv","id":"0801.1687","version":1},"attestation_state":"computed","paper":{"title":"Synthesis of Large Dynamic Concurrent Programs from Dynamic Specifications","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Paul C. Attie","submitted_at":"2008-01-10T21:27:42Z","abstract_excerpt":"We present a tractable method for synthesizing arbitrarily large concurrent programs, for a shared memory model with common hardware-available primitives such as atomic registers, compare-and-swap, load-linked/store conditional, etc. The programs we synthesize are dynamic: new processes can be created and added at run-time, and so our programs are not finite-state, in general. Nevertheless, we successfully exploit automatic synthesis and model-checking methods based on propositional temporal logic. Our method is algorithmically efficient, with complexity polynomial in the number of component p"},"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":"0801.1687","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2008-01-10T21:27:42Z","cross_cats_sorted":[],"title_canon_sha256":"20aa583da2bfed04ee349f0d11e35389faf952cc5cb1e08ca31551c6b4743962","abstract_canon_sha256":"fb8f668832a01d449968757d11d98f7c6ecc79c338bb9c76a191877774a74423"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:06:46.133608Z","signature_b64":"P4dAA1NiQQyKI13Dvw0KCYz8Kw1ZAHEvTIPQrKPAU+evLMlASn65YBziqTD1tnR2wors1N8QijwP2FJvGlraBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04e81293079b9f2ff0362b1ac1bc79256e7fc6a7af1c9e1f0ae3495f6e96e4cd","last_reissued_at":"2026-07-04T15:06:46.133228Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:06:46.133228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synthesis of Large Dynamic Concurrent Programs from Dynamic Specifications","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Paul C. Attie","submitted_at":"2008-01-10T21:27:42Z","abstract_excerpt":"We present a tractable method for synthesizing arbitrarily large concurrent programs, for a shared memory model with common hardware-available primitives such as atomic registers, compare-and-swap, load-linked/store conditional, etc. The programs we synthesize are dynamic: new processes can be created and added at run-time, and so our programs are not finite-state, in general. Nevertheless, we successfully exploit automatic synthesis and model-checking methods based on propositional temporal logic. Our method is algorithmically efficient, with complexity polynomial in the number of component p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.1687","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0801.1687/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"0801.1687","created_at":"2026-07-04T15:06:46.133296+00:00"},{"alias_kind":"arxiv_version","alias_value":"0801.1687v1","created_at":"2026-07-04T15:06:46.133296+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.1687","created_at":"2026-07-04T15:06:46.133296+00:00"},{"alias_kind":"pith_short_12","alias_value":"ATUBFEYHTOPS","created_at":"2026-07-04T15:06:46.133296+00:00"},{"alias_kind":"pith_short_16","alias_value":"ATUBFEYHTOPS74BW","created_at":"2026-07-04T15:06:46.133296+00:00"},{"alias_kind":"pith_short_8","alias_value":"ATUBFEYH","created_at":"2026-07-04T15:06:46.133296+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/ATUBFEYHTOPS74BWFMNMDPDZEV","json":"https://pith.science/pith/ATUBFEYHTOPS74BWFMNMDPDZEV.json","graph_json":"https://pith.science/api/pith-number/ATUBFEYHTOPS74BWFMNMDPDZEV/graph.json","events_json":"https://pith.science/api/pith-number/ATUBFEYHTOPS74BWFMNMDPDZEV/events.json","paper":"https://pith.science/paper/ATUBFEYH"},"agent_actions":{"view_html":"https://pith.science/pith/ATUBFEYHTOPS74BWFMNMDPDZEV","download_json":"https://pith.science/pith/ATUBFEYHTOPS74BWFMNMDPDZEV.json","view_paper":"https://pith.science/paper/ATUBFEYH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0801.1687&json=true","fetch_graph":"https://pith.science/api/pith-number/ATUBFEYHTOPS74BWFMNMDPDZEV/graph.json","fetch_events":"https://pith.science/api/pith-number/ATUBFEYHTOPS74BWFMNMDPDZEV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ATUBFEYHTOPS74BWFMNMDPDZEV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ATUBFEYHTOPS74BWFMNMDPDZEV/action/storage_attestation","attest_author":"https://pith.science/pith/ATUBFEYHTOPS74BWFMNMDPDZEV/action/author_attestation","sign_citation":"https://pith.science/pith/ATUBFEYHTOPS74BWFMNMDPDZEV/action/citation_signature","submit_replication":"https://pith.science/pith/ATUBFEYHTOPS74BWFMNMDPDZEV/action/replication_record"}},"created_at":"2026-07-04T15:06:46.133296+00:00","updated_at":"2026-07-04T15:06:46.133296+00:00"}