{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:OKXC7WJPAQV5M5OVJXKSL7LUWA","short_pith_number":"pith:OKXC7WJP","schema_version":"1.0","canonical_sha256":"72ae2fd92f042bd675d54dd525fd74b00c1c2a08511c18c09a729d656098b94e","source":{"kind":"arxiv","id":"0904.4902","version":2},"attestation_state":"computed","paper":{"title":"Simulating reachability using first-order logic with applications to verification of linked data structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Greta Yorsh, Mooly Sagiv, Neil Immerman, Siddharth Srivastava, Tal Lev-Ami, Thomas Reps","submitted_at":"2009-04-30T17:54:54Z","abstract_excerpt":"This paper shows how to harness existing theorem provers for first-order logic to automatically verify safety properties of imperative programs that perform dynamic storage allocation and destructive updating of pointer-valued structure fields. One of the main obstacles is specifying and proving the (absence) of reachability properties among dynamically allocated cells.\n  The main technical contributions are methods for simulating reachability in a conservative way using first-order formulas--the formulas describe a superset of the set of program states that would be specified if one had a pre"},"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":"0904.4902","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-04-30T17:54:54Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"048c12adcd1dbea1856c8275a939a1cd8dd25c41e2f2de8f776d05bde4b0fa50","abstract_canon_sha256":"383c05c04f92215217108fbb7a0a11e0193debec7cc8f09669089570041311b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:40.420522Z","signature_b64":"LW1IQEkf0AktMKnkddSZE2qb9d5JJiVokm+SYJlUeRyeCCG2oaZIhaLsZOhaxiRZruZyJArniPNXshZfsX1jCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72ae2fd92f042bd675d54dd525fd74b00c1c2a08511c18c09a729d656098b94e","last_reissued_at":"2026-05-18T01:37:40.419853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:40.419853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simulating reachability using first-order logic with applications to verification of linked data structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Greta Yorsh, Mooly Sagiv, Neil Immerman, Siddharth Srivastava, Tal Lev-Ami, Thomas Reps","submitted_at":"2009-04-30T17:54:54Z","abstract_excerpt":"This paper shows how to harness existing theorem provers for first-order logic to automatically verify safety properties of imperative programs that perform dynamic storage allocation and destructive updating of pointer-valued structure fields. One of the main obstacles is specifying and proving the (absence) of reachability properties among dynamically allocated cells.\n  The main technical contributions are methods for simulating reachability in a conservative way using first-order formulas--the formulas describe a superset of the set of program states that would be specified if one had a pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.4902","kind":"arxiv","version":2},"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":"0904.4902","created_at":"2026-05-18T01:37:40.419936+00:00"},{"alias_kind":"arxiv_version","alias_value":"0904.4902v2","created_at":"2026-05-18T01:37:40.419936+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.4902","created_at":"2026-05-18T01:37:40.419936+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKXC7WJPAQV5","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKXC7WJPAQV5M5OV","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKXC7WJP","created_at":"2026-05-18T12:26:01.383474+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/OKXC7WJPAQV5M5OVJXKSL7LUWA","json":"https://pith.science/pith/OKXC7WJPAQV5M5OVJXKSL7LUWA.json","graph_json":"https://pith.science/api/pith-number/OKXC7WJPAQV5M5OVJXKSL7LUWA/graph.json","events_json":"https://pith.science/api/pith-number/OKXC7WJPAQV5M5OVJXKSL7LUWA/events.json","paper":"https://pith.science/paper/OKXC7WJP"},"agent_actions":{"view_html":"https://pith.science/pith/OKXC7WJPAQV5M5OVJXKSL7LUWA","download_json":"https://pith.science/pith/OKXC7WJPAQV5M5OVJXKSL7LUWA.json","view_paper":"https://pith.science/paper/OKXC7WJP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0904.4902&json=true","fetch_graph":"https://pith.science/api/pith-number/OKXC7WJPAQV5M5OVJXKSL7LUWA/graph.json","fetch_events":"https://pith.science/api/pith-number/OKXC7WJPAQV5M5OVJXKSL7LUWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKXC7WJPAQV5M5OVJXKSL7LUWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKXC7WJPAQV5M5OVJXKSL7LUWA/action/storage_attestation","attest_author":"https://pith.science/pith/OKXC7WJPAQV5M5OVJXKSL7LUWA/action/author_attestation","sign_citation":"https://pith.science/pith/OKXC7WJPAQV5M5OVJXKSL7LUWA/action/citation_signature","submit_replication":"https://pith.science/pith/OKXC7WJPAQV5M5OVJXKSL7LUWA/action/replication_record"}},"created_at":"2026-05-18T01:37:40.419936+00:00","updated_at":"2026-05-18T01:37:40.419936+00:00"}