{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3FKFII3YLQLM52U4XI7IYOTGMW","short_pith_number":"pith:3FKFII3Y","schema_version":"1.0","canonical_sha256":"d9545423785c16ceea9cba3e8c3a6665b867405f4a11e630fe35d0d489b6daf0","source":{"kind":"arxiv","id":"1804.09352","version":2},"attestation_state":"computed","paper":{"title":"Shape Neutral Analysis of Graph-based Data-structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Gregory J. Duck, Joxan Jaffar, Roland H. C. Yap","submitted_at":"2018-04-25T05:13:21Z","abstract_excerpt":"Malformed data-structures can lead to runtime errors such as arbitrary memory access or corruption. Despite this, reasoning over data-structure properties for low-level heap manipulating programs remains challenging. In this paper we present a constraint-based program analysis that checks data-structure integrity, w.r.t. given target data-structure properties, as the heap is manipulated by the program. Our approach is to automatically generate a solver for properties using the type definitions from the target program. The generated solver is implemented using a Constraint Handling Rules (CHR) "},"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.09352","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-04-25T05:13:21Z","cross_cats_sorted":[],"title_canon_sha256":"82732f8f1427aeeb3768cef173537158f7aa86bd4975f1dbfb9223e312733ddd","abstract_canon_sha256":"d3f5b12ec25c5cea26b77e067990e47d7b916924e9bc1dfb2d4d941c21293db9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:53.169632Z","signature_b64":"HnLDnVte25gvGdeIClAKfkmvNnw+kurGGFAUzQqxQR3xLgs1xZMdisjBgA55kpk9dzHLJ1HKDlcUB2BBHfoWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9545423785c16ceea9cba3e8c3a6665b867405f4a11e630fe35d0d489b6daf0","last_reissued_at":"2026-05-18T00:16:53.169019Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:53.169019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shape Neutral Analysis of Graph-based Data-structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Gregory J. Duck, Joxan Jaffar, Roland H. C. Yap","submitted_at":"2018-04-25T05:13:21Z","abstract_excerpt":"Malformed data-structures can lead to runtime errors such as arbitrary memory access or corruption. Despite this, reasoning over data-structure properties for low-level heap manipulating programs remains challenging. In this paper we present a constraint-based program analysis that checks data-structure integrity, w.r.t. given target data-structure properties, as the heap is manipulated by the program. Our approach is to automatically generate a solver for properties using the type definitions from the target program. The generated solver is implemented using a Constraint Handling Rules (CHR) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09352","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.09352","created_at":"2026-05-18T00:16:53.169138+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.09352v2","created_at":"2026-05-18T00:16:53.169138+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09352","created_at":"2026-05-18T00:16:53.169138+00:00"},{"alias_kind":"pith_short_12","alias_value":"3FKFII3YLQLM","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3FKFII3YLQLM52U4","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3FKFII3Y","created_at":"2026-05-18T12:32:02.567920+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/3FKFII3YLQLM52U4XI7IYOTGMW","json":"https://pith.science/pith/3FKFII3YLQLM52U4XI7IYOTGMW.json","graph_json":"https://pith.science/api/pith-number/3FKFII3YLQLM52U4XI7IYOTGMW/graph.json","events_json":"https://pith.science/api/pith-number/3FKFII3YLQLM52U4XI7IYOTGMW/events.json","paper":"https://pith.science/paper/3FKFII3Y"},"agent_actions":{"view_html":"https://pith.science/pith/3FKFII3YLQLM52U4XI7IYOTGMW","download_json":"https://pith.science/pith/3FKFII3YLQLM52U4XI7IYOTGMW.json","view_paper":"https://pith.science/paper/3FKFII3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.09352&json=true","fetch_graph":"https://pith.science/api/pith-number/3FKFII3YLQLM52U4XI7IYOTGMW/graph.json","fetch_events":"https://pith.science/api/pith-number/3FKFII3YLQLM52U4XI7IYOTGMW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3FKFII3YLQLM52U4XI7IYOTGMW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3FKFII3YLQLM52U4XI7IYOTGMW/action/storage_attestation","attest_author":"https://pith.science/pith/3FKFII3YLQLM52U4XI7IYOTGMW/action/author_attestation","sign_citation":"https://pith.science/pith/3FKFII3YLQLM52U4XI7IYOTGMW/action/citation_signature","submit_replication":"https://pith.science/pith/3FKFII3YLQLM52U4XI7IYOTGMW/action/replication_record"}},"created_at":"2026-05-18T00:16:53.169138+00:00","updated_at":"2026-05-18T00:16:53.169138+00:00"}