{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6FHDY343PVJUQSDLZPHTRR7OB6","short_pith_number":"pith:6FHDY343","schema_version":"1.0","canonical_sha256":"f14e3c6f9b7d5348486bcbcf38c7ee0f8855709fbc2835ddf62f3e424abc4a34","source":{"kind":"arxiv","id":"1908.05799","version":1},"attestation_state":"computed","paper":{"title":"Modular Verification of Heap Reachability Properties in Separation Logic","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Alexander J. Summers, Arshavir Ter-Gabrielyan, Peter M\\\"uller","submitted_at":"2019-08-16T00:18:43Z","abstract_excerpt":"The correctness of many algorithms and data structures depends on reachability properties, that is, on the existence of chains of references between objects in the heap. Reasoning about reachability is difficult for two main reasons. First, any heap modification may affect an unbounded number of reference chains, which complicates modular verification, in particular, framing. Second, general graph reachability is not supported by SMT solvers, which impedes automatic verification. In this paper, we present a modular specification and verification technique for reachability properties in separat"},"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":"1908.05799","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2019-08-16T00:18:43Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"3eb5690af5e9234cab361fd36d422f9e985bb42ba794ffcf9bb0244c97d9f7c7","abstract_canon_sha256":"e5a44bcd8bc36855114352daebc7aba0cf143f99d45281c911bca191fa3a0cf6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:57:53.299811Z","signature_b64":"1ce7OvLoleE8DWvaPqDLzOlE8VdavlbIULVsHTw2xntImOl/xJRStKTr3v+Oa0TqFSTm2fneXuTTOEIsvzaeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f14e3c6f9b7d5348486bcbcf38c7ee0f8855709fbc2835ddf62f3e424abc4a34","last_reissued_at":"2026-07-04T23:57:53.299383Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:57:53.299383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modular Verification of Heap Reachability Properties in Separation Logic","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Alexander J. Summers, Arshavir Ter-Gabrielyan, Peter M\\\"uller","submitted_at":"2019-08-16T00:18:43Z","abstract_excerpt":"The correctness of many algorithms and data structures depends on reachability properties, that is, on the existence of chains of references between objects in the heap. Reasoning about reachability is difficult for two main reasons. First, any heap modification may affect an unbounded number of reference chains, which complicates modular verification, in particular, framing. Second, general graph reachability is not supported by SMT solvers, which impedes automatic verification. In this paper, we present a modular specification and verification technique for reachability properties in separat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05799","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/1908.05799/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":"1908.05799","created_at":"2026-07-04T23:57:53.299439+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.05799v1","created_at":"2026-07-04T23:57:53.299439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05799","created_at":"2026-07-04T23:57:53.299439+00:00"},{"alias_kind":"pith_short_12","alias_value":"6FHDY343PVJU","created_at":"2026-07-04T23:57:53.299439+00:00"},{"alias_kind":"pith_short_16","alias_value":"6FHDY343PVJUQSDL","created_at":"2026-07-04T23:57:53.299439+00:00"},{"alias_kind":"pith_short_8","alias_value":"6FHDY343","created_at":"2026-07-04T23:57:53.299439+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/6FHDY343PVJUQSDLZPHTRR7OB6","json":"https://pith.science/pith/6FHDY343PVJUQSDLZPHTRR7OB6.json","graph_json":"https://pith.science/api/pith-number/6FHDY343PVJUQSDLZPHTRR7OB6/graph.json","events_json":"https://pith.science/api/pith-number/6FHDY343PVJUQSDLZPHTRR7OB6/events.json","paper":"https://pith.science/paper/6FHDY343"},"agent_actions":{"view_html":"https://pith.science/pith/6FHDY343PVJUQSDLZPHTRR7OB6","download_json":"https://pith.science/pith/6FHDY343PVJUQSDLZPHTRR7OB6.json","view_paper":"https://pith.science/paper/6FHDY343","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.05799&json=true","fetch_graph":"https://pith.science/api/pith-number/6FHDY343PVJUQSDLZPHTRR7OB6/graph.json","fetch_events":"https://pith.science/api/pith-number/6FHDY343PVJUQSDLZPHTRR7OB6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6FHDY343PVJUQSDLZPHTRR7OB6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6FHDY343PVJUQSDLZPHTRR7OB6/action/storage_attestation","attest_author":"https://pith.science/pith/6FHDY343PVJUQSDLZPHTRR7OB6/action/author_attestation","sign_citation":"https://pith.science/pith/6FHDY343PVJUQSDLZPHTRR7OB6/action/citation_signature","submit_replication":"https://pith.science/pith/6FHDY343PVJUQSDLZPHTRR7OB6/action/replication_record"}},"created_at":"2026-07-04T23:57:53.299439+00:00","updated_at":"2026-07-04T23:57:53.299439+00:00"}