{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IRSWZVTFJRH77D7V7OD7EO7D5J","short_pith_number":"pith:IRSWZVTF","schema_version":"1.0","canonical_sha256":"44656cd6654c4fff8ff5fb87f23be3ea7f9118266c432efbc451a01d5ed6f7ff","source":{"kind":"arxiv","id":"1705.07354","version":3},"attestation_state":"computed","paper":{"title":"The Meaning of Memory Safety","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.PL","authors_text":"Arthur Azevedo de Amorim, Benjamin C. Pierce, Catalin Hritcu","submitted_at":"2017-05-20T20:08:30Z","abstract_excerpt":"We give a rigorous characterization of what it means for a programming language to be memory safe, capturing the intuition that memory safety supports local reasoning about state. We formalize this principle in two ways. First, we show how a small memory-safe language validates a noninterference property: a program can neither affect nor be affected by unreachable parts of the state. Second, we extend separation logic, a proof system for heap-manipulating programs, with a memory-safe variant of its frame rule. The new rule is stronger because it applies even when parts of the program are buggy"},"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.07354","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2017-05-20T20:08:30Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"b7703343a39019b063afd851eaab839c4da281873681d7ca93de7fca86c6c353","abstract_canon_sha256":"3b00e55786194c61659270a1d0961f75404cb12128b3c37799d79b2a5ed2b0c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:04.080969Z","signature_b64":"ZLLpb3T0Xz9Y7OFm1EuMqcZXk6qfxO00623Vcqzltb48dVrYxliJsYBlmvmkjbdCZbweCq/nJM76xCZWd4aNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44656cd6654c4fff8ff5fb87f23be3ea7f9118266c432efbc451a01d5ed6f7ff","last_reissued_at":"2026-05-18T00:19:04.080414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:04.080414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Meaning of Memory Safety","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.PL","authors_text":"Arthur Azevedo de Amorim, Benjamin C. Pierce, Catalin Hritcu","submitted_at":"2017-05-20T20:08:30Z","abstract_excerpt":"We give a rigorous characterization of what it means for a programming language to be memory safe, capturing the intuition that memory safety supports local reasoning about state. We formalize this principle in two ways. First, we show how a small memory-safe language validates a noninterference property: a program can neither affect nor be affected by unreachable parts of the state. Second, we extend separation logic, a proof system for heap-manipulating programs, with a memory-safe variant of its frame rule. The new rule is stronger because it applies even when parts of the program are buggy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07354","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":"1705.07354","created_at":"2026-05-18T00:19:04.080501+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07354v3","created_at":"2026-05-18T00:19:04.080501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07354","created_at":"2026-05-18T00:19:04.080501+00:00"},{"alias_kind":"pith_short_12","alias_value":"IRSWZVTFJRH7","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IRSWZVTFJRH77D7V","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IRSWZVTF","created_at":"2026-05-18T12:31:21.493067+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/IRSWZVTFJRH77D7V7OD7EO7D5J","json":"https://pith.science/pith/IRSWZVTFJRH77D7V7OD7EO7D5J.json","graph_json":"https://pith.science/api/pith-number/IRSWZVTFJRH77D7V7OD7EO7D5J/graph.json","events_json":"https://pith.science/api/pith-number/IRSWZVTFJRH77D7V7OD7EO7D5J/events.json","paper":"https://pith.science/paper/IRSWZVTF"},"agent_actions":{"view_html":"https://pith.science/pith/IRSWZVTFJRH77D7V7OD7EO7D5J","download_json":"https://pith.science/pith/IRSWZVTFJRH77D7V7OD7EO7D5J.json","view_paper":"https://pith.science/paper/IRSWZVTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07354&json=true","fetch_graph":"https://pith.science/api/pith-number/IRSWZVTFJRH77D7V7OD7EO7D5J/graph.json","fetch_events":"https://pith.science/api/pith-number/IRSWZVTFJRH77D7V7OD7EO7D5J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IRSWZVTFJRH77D7V7OD7EO7D5J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IRSWZVTFJRH77D7V7OD7EO7D5J/action/storage_attestation","attest_author":"https://pith.science/pith/IRSWZVTFJRH77D7V7OD7EO7D5J/action/author_attestation","sign_citation":"https://pith.science/pith/IRSWZVTFJRH77D7V7OD7EO7D5J/action/citation_signature","submit_replication":"https://pith.science/pith/IRSWZVTFJRH77D7V7OD7EO7D5J/action/replication_record"}},"created_at":"2026-05-18T00:19:04.080501+00:00","updated_at":"2026-05-18T00:19:04.080501+00:00"}