{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QHNUYVMZZPBKTBKLTVKWSGRUAS","short_pith_number":"pith:QHNUYVMZ","schema_version":"1.0","canonical_sha256":"81db4c5599cbc2a9854b9d55691a34048870a89b7b162fef74fd62bd95f29561","source":{"kind":"arxiv","id":"1804.08470","version":2},"attestation_state":"computed","paper":{"title":"Automatic Heap Layout Manipulation for Exploitation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.CR","authors_text":"Daniel Kroening, Sean Heelan, Tom Melham","submitted_at":"2018-04-23T14:32:45Z","abstract_excerpt":"Heap layout manipulation is integral to exploiting heap-based memory corruption vulnerabilities. In this paper we present the first automatic approach to the problem, based on pseudo-random black-box search. Our approach searches for the inputs required to place the source of a heap-based buffer overflow or underflow next to heap-allocated objects that an exploit developer, or automatic exploit generation system, wishes to read or corrupt. We present a framework for benchmarking heap layout manipulation algorithms, and use it to evaluate our approach on several real-world allocators, showing t"},"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.08470","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-04-23T14:32:45Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"0e945ea5c68f5f5267a095c81ee91946fdee4a09ddaac9008c71e58f6e4df294","abstract_canon_sha256":"2606028bc2547fec6563527921ebe91a6d5c4d5b04ed296db22e9432461c304f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:40.077369Z","signature_b64":"X9g7vhnZw4R9qwUEBbgQ1Q4wzT/sTolC+6a2SyUxxSm6mrh5vC2OG8U2dPqhG7tv8P+AsZNprMWrnaN1rDWECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81db4c5599cbc2a9854b9d55691a34048870a89b7b162fef74fd62bd95f29561","last_reissued_at":"2026-05-18T00:06:40.076987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:40.076987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatic Heap Layout Manipulation for Exploitation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.CR","authors_text":"Daniel Kroening, Sean Heelan, Tom Melham","submitted_at":"2018-04-23T14:32:45Z","abstract_excerpt":"Heap layout manipulation is integral to exploiting heap-based memory corruption vulnerabilities. In this paper we present the first automatic approach to the problem, based on pseudo-random black-box search. Our approach searches for the inputs required to place the source of a heap-based buffer overflow or underflow next to heap-allocated objects that an exploit developer, or automatic exploit generation system, wishes to read or corrupt. We present a framework for benchmarking heap layout manipulation algorithms, and use it to evaluate our approach on several real-world allocators, showing t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08470","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":"1804.08470","created_at":"2026-05-18T00:06:40.077047+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.08470v2","created_at":"2026-05-18T00:06:40.077047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08470","created_at":"2026-05-18T00:06:40.077047+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHNUYVMZZPBK","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHNUYVMZZPBKTBKL","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHNUYVMZ","created_at":"2026-05-18T12:32:46.962924+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/QHNUYVMZZPBKTBKLTVKWSGRUAS","json":"https://pith.science/pith/QHNUYVMZZPBKTBKLTVKWSGRUAS.json","graph_json":"https://pith.science/api/pith-number/QHNUYVMZZPBKTBKLTVKWSGRUAS/graph.json","events_json":"https://pith.science/api/pith-number/QHNUYVMZZPBKTBKLTVKWSGRUAS/events.json","paper":"https://pith.science/paper/QHNUYVMZ"},"agent_actions":{"view_html":"https://pith.science/pith/QHNUYVMZZPBKTBKLTVKWSGRUAS","download_json":"https://pith.science/pith/QHNUYVMZZPBKTBKLTVKWSGRUAS.json","view_paper":"https://pith.science/paper/QHNUYVMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.08470&json=true","fetch_graph":"https://pith.science/api/pith-number/QHNUYVMZZPBKTBKLTVKWSGRUAS/graph.json","fetch_events":"https://pith.science/api/pith-number/QHNUYVMZZPBKTBKLTVKWSGRUAS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHNUYVMZZPBKTBKLTVKWSGRUAS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHNUYVMZZPBKTBKLTVKWSGRUAS/action/storage_attestation","attest_author":"https://pith.science/pith/QHNUYVMZZPBKTBKLTVKWSGRUAS/action/author_attestation","sign_citation":"https://pith.science/pith/QHNUYVMZZPBKTBKLTVKWSGRUAS/action/citation_signature","submit_replication":"https://pith.science/pith/QHNUYVMZZPBKTBKLTVKWSGRUAS/action/replication_record"}},"created_at":"2026-05-18T00:06:40.077047+00:00","updated_at":"2026-05-18T00:06:40.077047+00:00"}