{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:46QQDNSKOU4OJH34NOJRRKCBK3","short_pith_number":"pith:46QQDNSK","schema_version":"1.0","canonical_sha256":"e7a101b64a7538e49f7c6b9318a84156f86d5aa966e620a718f1737f5d03c4dc","source":{"kind":"arxiv","id":"1804.04091","version":1},"attestation_state":"computed","paper":{"title":"Permission Inference for Array Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Alexander J. Summers, Caterina Urban, J\\'er\\^ome Dohrau, Peter M\\\"uller, Severin M\\\"unger","submitted_at":"2018-04-11T16:54:52Z","abstract_excerpt":"Information about the memory locations accessed by a program is, for instance, required for program parallelisation and program verification. Existing inference techniques for this information provide only partial solutions for the important class of array-manipulating programs. In this paper, we present a static analysis that infers the memory footprint of an array program in terms of permission pre- and postconditions as used, for example, in separation logic. This formulation allows our analysis to handle concurrent programs and produces specifications that can be used by verification tools"},"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":"1804.04091","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-04-11T16:54:52Z","cross_cats_sorted":[],"title_canon_sha256":"23c8cf08bda98fa2ca907fc4dfcfa4e2ac6440d6f774061a80f8e91956ccb37b","abstract_canon_sha256":"fee360ef0a51c86eab87d9455c379fb8c06ce01a99cf96f52c7badccf7ec8f69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:42.119129Z","signature_b64":"kqxcQGGOjI0hBHLghmAg+IK1YZvHmN34lZH1UOujjsJUzXMNvB8/NjYDJk3HtIdC2PFIOF5+IvyKITYIUXzYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7a101b64a7538e49f7c6b9318a84156f86d5aa966e620a718f1737f5d03c4dc","last_reissued_at":"2026-05-18T00:18:42.118525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:42.118525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Permission Inference for Array Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Alexander J. Summers, Caterina Urban, J\\'er\\^ome Dohrau, Peter M\\\"uller, Severin M\\\"unger","submitted_at":"2018-04-11T16:54:52Z","abstract_excerpt":"Information about the memory locations accessed by a program is, for instance, required for program parallelisation and program verification. Existing inference techniques for this information provide only partial solutions for the important class of array-manipulating programs. In this paper, we present a static analysis that infers the memory footprint of an array program in terms of permission pre- and postconditions as used, for example, in separation logic. This formulation allows our analysis to handle concurrent programs and produces specifications that can be used by verification tools"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04091","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":"1804.04091","created_at":"2026-05-18T00:18:42.118621+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.04091v1","created_at":"2026-05-18T00:18:42.118621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04091","created_at":"2026-05-18T00:18:42.118621+00:00"},{"alias_kind":"pith_short_12","alias_value":"46QQDNSKOU4O","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"46QQDNSKOU4OJH34","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"46QQDNSK","created_at":"2026-05-18T12:32:05.422762+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/46QQDNSKOU4OJH34NOJRRKCBK3","json":"https://pith.science/pith/46QQDNSKOU4OJH34NOJRRKCBK3.json","graph_json":"https://pith.science/api/pith-number/46QQDNSKOU4OJH34NOJRRKCBK3/graph.json","events_json":"https://pith.science/api/pith-number/46QQDNSKOU4OJH34NOJRRKCBK3/events.json","paper":"https://pith.science/paper/46QQDNSK"},"agent_actions":{"view_html":"https://pith.science/pith/46QQDNSKOU4OJH34NOJRRKCBK3","download_json":"https://pith.science/pith/46QQDNSKOU4OJH34NOJRRKCBK3.json","view_paper":"https://pith.science/paper/46QQDNSK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.04091&json=true","fetch_graph":"https://pith.science/api/pith-number/46QQDNSKOU4OJH34NOJRRKCBK3/graph.json","fetch_events":"https://pith.science/api/pith-number/46QQDNSKOU4OJH34NOJRRKCBK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/46QQDNSKOU4OJH34NOJRRKCBK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/46QQDNSKOU4OJH34NOJRRKCBK3/action/storage_attestation","attest_author":"https://pith.science/pith/46QQDNSKOU4OJH34NOJRRKCBK3/action/author_attestation","sign_citation":"https://pith.science/pith/46QQDNSKOU4OJH34NOJRRKCBK3/action/citation_signature","submit_replication":"https://pith.science/pith/46QQDNSKOU4OJH34NOJRRKCBK3/action/replication_record"}},"created_at":"2026-05-18T00:18:42.118621+00:00","updated_at":"2026-05-18T00:18:42.118621+00:00"}