{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:R4NULLPMSR4OGZ6MFIMJKAYYT7","short_pith_number":"pith:R4NULLPM","schema_version":"1.0","canonical_sha256":"8f1b45adec9478e367cc2a189503189fe44d52870bda4c733d4db099ea47a100","source":{"kind":"arxiv","id":"2106.00732","version":1},"attestation_state":"computed","paper":{"title":"Modular Verification of Concurrent Programs via Sequential Model Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Dan Rasin, Orna Grumberg, Sharon Shoham","submitted_at":"2021-06-01T19:15:34Z","abstract_excerpt":"This work utilizes the plethora of work on verification of sequential programs for the purpose of verifying concurrent programs. We reduce the verification of a concurrent program to a series of verification tasks of sequential programs. Our approach is modular in the sense that each sequential verification task roughly corresponds to the verification of a single thread, with some additional information about the environment in which it operates. Information regarding the environment is gathered during the run of the algorithm, by need.\n  While our approach is general, it specializes on concur"},"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":"2106.00732","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2021-06-01T19:15:34Z","cross_cats_sorted":[],"title_canon_sha256":"eb95c36464ca9b4108e5a659ac8b6d6d502973909b88eb2f42971f4850641c48","abstract_canon_sha256":"4355a5945deb5dbb3b2f0671b5962f68e4330311e9eb5458a1f5ffff817d8391"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:45:39.402682Z","signature_b64":"1X9lHJoDFMUuqZXeyNwlolB94zWRRq9bjqByncMrqmalHGbJfTnxmlqMFmJjm9Go1MaW/8ibNoFo8wLsaKqHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f1b45adec9478e367cc2a189503189fe44d52870bda4c733d4db099ea47a100","last_reissued_at":"2026-07-05T02:45:39.402342Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:45:39.402342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modular Verification of Concurrent Programs via Sequential Model Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Dan Rasin, Orna Grumberg, Sharon Shoham","submitted_at":"2021-06-01T19:15:34Z","abstract_excerpt":"This work utilizes the plethora of work on verification of sequential programs for the purpose of verifying concurrent programs. We reduce the verification of a concurrent program to a series of verification tasks of sequential programs. Our approach is modular in the sense that each sequential verification task roughly corresponds to the verification of a single thread, with some additional information about the environment in which it operates. Information regarding the environment is gathered during the run of the algorithm, by need.\n  While our approach is general, it specializes on concur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.00732","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/2106.00732/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":"2106.00732","created_at":"2026-07-05T02:45:39.402398+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.00732v1","created_at":"2026-07-05T02:45:39.402398+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.00732","created_at":"2026-07-05T02:45:39.402398+00:00"},{"alias_kind":"pith_short_12","alias_value":"R4NULLPMSR4O","created_at":"2026-07-05T02:45:39.402398+00:00"},{"alias_kind":"pith_short_16","alias_value":"R4NULLPMSR4OGZ6M","created_at":"2026-07-05T02:45:39.402398+00:00"},{"alias_kind":"pith_short_8","alias_value":"R4NULLPM","created_at":"2026-07-05T02:45:39.402398+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/R4NULLPMSR4OGZ6MFIMJKAYYT7","json":"https://pith.science/pith/R4NULLPMSR4OGZ6MFIMJKAYYT7.json","graph_json":"https://pith.science/api/pith-number/R4NULLPMSR4OGZ6MFIMJKAYYT7/graph.json","events_json":"https://pith.science/api/pith-number/R4NULLPMSR4OGZ6MFIMJKAYYT7/events.json","paper":"https://pith.science/paper/R4NULLPM"},"agent_actions":{"view_html":"https://pith.science/pith/R4NULLPMSR4OGZ6MFIMJKAYYT7","download_json":"https://pith.science/pith/R4NULLPMSR4OGZ6MFIMJKAYYT7.json","view_paper":"https://pith.science/paper/R4NULLPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.00732&json=true","fetch_graph":"https://pith.science/api/pith-number/R4NULLPMSR4OGZ6MFIMJKAYYT7/graph.json","fetch_events":"https://pith.science/api/pith-number/R4NULLPMSR4OGZ6MFIMJKAYYT7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R4NULLPMSR4OGZ6MFIMJKAYYT7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R4NULLPMSR4OGZ6MFIMJKAYYT7/action/storage_attestation","attest_author":"https://pith.science/pith/R4NULLPMSR4OGZ6MFIMJKAYYT7/action/author_attestation","sign_citation":"https://pith.science/pith/R4NULLPMSR4OGZ6MFIMJKAYYT7/action/citation_signature","submit_replication":"https://pith.science/pith/R4NULLPMSR4OGZ6MFIMJKAYYT7/action/replication_record"}},"created_at":"2026-07-05T02:45:39.402398+00:00","updated_at":"2026-07-05T02:45:39.402398+00:00"}