{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NBPYTFNK37FY7VXH2VS7MX2Y6N","short_pith_number":"pith:NBPYTFNK","schema_version":"1.0","canonical_sha256":"685f8995aadfcb8fd6e7d565f65f58f35e8c9bf592688a7de213aaa025edc244","source":{"kind":"arxiv","id":"1603.00649","version":3},"attestation_state":"computed","paper":{"title":"Automatic Verification of Iterated Separating Conjunctions using Symbolic Execution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Alexander J. Summers, Malte Schwerhoff, Peter M\\\"uller","submitted_at":"2016-03-02T10:41:47Z","abstract_excerpt":"In permission logics such as separation logic, the iterated separating conjunction is a quantifier denoting access permission to an unbounded set of heap locations. In contrast to recursive predicates, iterated separating conjunctions do not prescribe a structure on the locations they range over, and so do not restrict how to traverse and modify these locations. This flexibility is important for the verification of random-access data structures such as arrays and data structures that can be traversed in multiple ways such as graphs. Despite its usefulness, no automatic program verifier nativel"},"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":"1603.00649","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-03-02T10:41:47Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"978abfc9298ef194e59a975878a00b6b3eb99533adb93458ba652682d39731b7","abstract_canon_sha256":"06a6ca7c034c200d9170481b3528ce7ed0d072984dab5a9eeb13bc7a961281fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:31.965204Z","signature_b64":"c1jBr0tlpBGU2PhxvhY+Saa6zQGbCH9OYzShq0xpLY8sRdlOmRWr6gqYYICbWKl2LzO7OfUGCSW3XQJ0UUwbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"685f8995aadfcb8fd6e7d565f65f58f35e8c9bf592688a7de213aaa025edc244","last_reissued_at":"2026-05-18T01:15:31.964346Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:31.964346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatic Verification of Iterated Separating Conjunctions using Symbolic Execution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Alexander J. Summers, Malte Schwerhoff, Peter M\\\"uller","submitted_at":"2016-03-02T10:41:47Z","abstract_excerpt":"In permission logics such as separation logic, the iterated separating conjunction is a quantifier denoting access permission to an unbounded set of heap locations. In contrast to recursive predicates, iterated separating conjunctions do not prescribe a structure on the locations they range over, and so do not restrict how to traverse and modify these locations. This flexibility is important for the verification of random-access data structures such as arrays and data structures that can be traversed in multiple ways such as graphs. Despite its usefulness, no automatic program verifier nativel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00649","kind":"arxiv","version":3},"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":"1603.00649","created_at":"2026-05-18T01:15:31.964504+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.00649v3","created_at":"2026-05-18T01:15:31.964504+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00649","created_at":"2026-05-18T01:15:31.964504+00:00"},{"alias_kind":"pith_short_12","alias_value":"NBPYTFNK37FY","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NBPYTFNK37FY7VXH","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NBPYTFNK","created_at":"2026-05-18T12:30:32.724797+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/NBPYTFNK37FY7VXH2VS7MX2Y6N","json":"https://pith.science/pith/NBPYTFNK37FY7VXH2VS7MX2Y6N.json","graph_json":"https://pith.science/api/pith-number/NBPYTFNK37FY7VXH2VS7MX2Y6N/graph.json","events_json":"https://pith.science/api/pith-number/NBPYTFNK37FY7VXH2VS7MX2Y6N/events.json","paper":"https://pith.science/paper/NBPYTFNK"},"agent_actions":{"view_html":"https://pith.science/pith/NBPYTFNK37FY7VXH2VS7MX2Y6N","download_json":"https://pith.science/pith/NBPYTFNK37FY7VXH2VS7MX2Y6N.json","view_paper":"https://pith.science/paper/NBPYTFNK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.00649&json=true","fetch_graph":"https://pith.science/api/pith-number/NBPYTFNK37FY7VXH2VS7MX2Y6N/graph.json","fetch_events":"https://pith.science/api/pith-number/NBPYTFNK37FY7VXH2VS7MX2Y6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NBPYTFNK37FY7VXH2VS7MX2Y6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NBPYTFNK37FY7VXH2VS7MX2Y6N/action/storage_attestation","attest_author":"https://pith.science/pith/NBPYTFNK37FY7VXH2VS7MX2Y6N/action/author_attestation","sign_citation":"https://pith.science/pith/NBPYTFNK37FY7VXH2VS7MX2Y6N/action/citation_signature","submit_replication":"https://pith.science/pith/NBPYTFNK37FY7VXH2VS7MX2Y6N/action/replication_record"}},"created_at":"2026-05-18T01:15:31.964504+00:00","updated_at":"2026-05-18T01:15:31.964504+00:00"}