{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:S5F5JPHVUYJLFEIWJCJBNJG4BF","short_pith_number":"pith:S5F5JPHV","schema_version":"1.0","canonical_sha256":"974bd4bcf5a612b29116489216a4dc096f0acb40096c7d0fc3810b58597b707f","source":{"kind":"arxiv","id":"1705.03701","version":1},"attestation_state":"computed","paper":{"title":"Effect Summaries for Thread-Modular Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Luk\\'a\\v{s} Hol\\'ik, Roland Meyer, Sebastian Wolff, Tom\\'a\\v{s} Vojnar","submitted_at":"2017-05-10T11:17:57Z","abstract_excerpt":"We propose a novel guess-and-check principle to increase the efficiency of thread-modular verification of lock-free data structures. We build on a heuristic that guesses candidates for stateless effect summaries of programs by searching the code for instances of a copy-and-check programming idiom common in lock-free data structures. These candidate summaries are used to compute the interference among threads in linear time. Since a candidate summary need not be a sound effect summary, we show how to fully automatically check whether the precision of candidate summaries is sufficient. We can th"},"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":"1705.03701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-05-10T11:17:57Z","cross_cats_sorted":[],"title_canon_sha256":"3e6f1e3362be5203f1ed1e10a02c1c4225065330dd36258352612e02e92f966c","abstract_canon_sha256":"b69f9d7041eaa0502f58cb179183911c323e6b512d9db6607f0a9065c739982f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:43.192034Z","signature_b64":"REP90RROUVg/UJspUcFVMyX35zSgCShmBgnPWDJifxWS57xenV6Nuu6Fte3GAtx5bzb9VIYf5GP3GpaCbwHPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"974bd4bcf5a612b29116489216a4dc096f0acb40096c7d0fc3810b58597b707f","last_reissued_at":"2026-05-18T00:44:43.191634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:43.191634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effect Summaries for Thread-Modular Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Luk\\'a\\v{s} Hol\\'ik, Roland Meyer, Sebastian Wolff, Tom\\'a\\v{s} Vojnar","submitted_at":"2017-05-10T11:17:57Z","abstract_excerpt":"We propose a novel guess-and-check principle to increase the efficiency of thread-modular verification of lock-free data structures. We build on a heuristic that guesses candidates for stateless effect summaries of programs by searching the code for instances of a copy-and-check programming idiom common in lock-free data structures. These candidate summaries are used to compute the interference among threads in linear time. Since a candidate summary need not be a sound effect summary, we show how to fully automatically check whether the precision of candidate summaries is sufficient. We can th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03701","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":"1705.03701","created_at":"2026-05-18T00:44:43.191700+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.03701v1","created_at":"2026-05-18T00:44:43.191700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03701","created_at":"2026-05-18T00:44:43.191700+00:00"},{"alias_kind":"pith_short_12","alias_value":"S5F5JPHVUYJL","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"S5F5JPHVUYJLFEIW","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"S5F5JPHV","created_at":"2026-05-18T12:31:43.269735+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/S5F5JPHVUYJLFEIWJCJBNJG4BF","json":"https://pith.science/pith/S5F5JPHVUYJLFEIWJCJBNJG4BF.json","graph_json":"https://pith.science/api/pith-number/S5F5JPHVUYJLFEIWJCJBNJG4BF/graph.json","events_json":"https://pith.science/api/pith-number/S5F5JPHVUYJLFEIWJCJBNJG4BF/events.json","paper":"https://pith.science/paper/S5F5JPHV"},"agent_actions":{"view_html":"https://pith.science/pith/S5F5JPHVUYJLFEIWJCJBNJG4BF","download_json":"https://pith.science/pith/S5F5JPHVUYJLFEIWJCJBNJG4BF.json","view_paper":"https://pith.science/paper/S5F5JPHV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.03701&json=true","fetch_graph":"https://pith.science/api/pith-number/S5F5JPHVUYJLFEIWJCJBNJG4BF/graph.json","fetch_events":"https://pith.science/api/pith-number/S5F5JPHVUYJLFEIWJCJBNJG4BF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S5F5JPHVUYJLFEIWJCJBNJG4BF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S5F5JPHVUYJLFEIWJCJBNJG4BF/action/storage_attestation","attest_author":"https://pith.science/pith/S5F5JPHVUYJLFEIWJCJBNJG4BF/action/author_attestation","sign_citation":"https://pith.science/pith/S5F5JPHVUYJLFEIWJCJBNJG4BF/action/citation_signature","submit_replication":"https://pith.science/pith/S5F5JPHVUYJLFEIWJCJBNJG4BF/action/replication_record"}},"created_at":"2026-05-18T00:44:43.191700+00:00","updated_at":"2026-05-18T00:44:43.191700+00:00"}