{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NQWW6OS3YM4E6AOPL3CJMPKN5O","short_pith_number":"pith:NQWW6OS3","schema_version":"1.0","canonical_sha256":"6c2d6f3a5bc3384f01cf5ec4963d4deb800328adcdebd2143e7d82dcae235308","source":{"kind":"arxiv","id":"1511.07267","version":3},"attestation_state":"computed","paper":{"title":"Automatic Reasoning on Recursive Data-Structures with Sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Duc-Hiep Chu, Joxan Jaffar","submitted_at":"2015-11-23T15:18:19Z","abstract_excerpt":"We consider the problem of automatically verifying programs which manipulate arbitrary data structures. Our specification language is expressive, contains a notion of \\emph{separation}, and thus enables a precise specification of \\emph{frames}. The main contribution then is a program verification method which combines strongest postcondition reasoning in the form symbolic execution, unfolding recursive definitions of the data structure in question, and a new frame rule to achieve \\emph{local reasoning} so that proofs can be compositional. Finally, we present an implementation of our verifier, "},"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":"1511.07267","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-11-23T15:18:19Z","cross_cats_sorted":[],"title_canon_sha256":"9903e8f9cb1c8681bc1fa03a07accbcd504d5fdf2e865623de19a3670bd6ca6f","abstract_canon_sha256":"7e6de21924d38be0f2cab878f21981e0341bd72ef3c42e39fe2d05c84ca8728d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:33.120150Z","signature_b64":"sRJux6ThJvFvk7S+eJqnBZS0TLLftXtJtLF/Pg4i7DVlQBERYEVJBcEsbEKFy2kUdsE/vy/Jk0bY0P8fq0IFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c2d6f3a5bc3384f01cf5ec4963d4deb800328adcdebd2143e7d82dcae235308","last_reissued_at":"2026-05-18T00:30:33.119543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:33.119543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatic Reasoning on Recursive Data-Structures with Sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Duc-Hiep Chu, Joxan Jaffar","submitted_at":"2015-11-23T15:18:19Z","abstract_excerpt":"We consider the problem of automatically verifying programs which manipulate arbitrary data structures. Our specification language is expressive, contains a notion of \\emph{separation}, and thus enables a precise specification of \\emph{frames}. The main contribution then is a program verification method which combines strongest postcondition reasoning in the form symbolic execution, unfolding recursive definitions of the data structure in question, and a new frame rule to achieve \\emph{local reasoning} so that proofs can be compositional. Finally, we present an implementation of our verifier, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07267","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":"1511.07267","created_at":"2026-05-18T00:30:33.119635+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07267v3","created_at":"2026-05-18T00:30:33.119635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07267","created_at":"2026-05-18T00:30:33.119635+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQWW6OS3YM4E","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQWW6OS3YM4E6AOP","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQWW6OS3","created_at":"2026-05-18T12:29:34.919912+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/NQWW6OS3YM4E6AOPL3CJMPKN5O","json":"https://pith.science/pith/NQWW6OS3YM4E6AOPL3CJMPKN5O.json","graph_json":"https://pith.science/api/pith-number/NQWW6OS3YM4E6AOPL3CJMPKN5O/graph.json","events_json":"https://pith.science/api/pith-number/NQWW6OS3YM4E6AOPL3CJMPKN5O/events.json","paper":"https://pith.science/paper/NQWW6OS3"},"agent_actions":{"view_html":"https://pith.science/pith/NQWW6OS3YM4E6AOPL3CJMPKN5O","download_json":"https://pith.science/pith/NQWW6OS3YM4E6AOPL3CJMPKN5O.json","view_paper":"https://pith.science/paper/NQWW6OS3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07267&json=true","fetch_graph":"https://pith.science/api/pith-number/NQWW6OS3YM4E6AOPL3CJMPKN5O/graph.json","fetch_events":"https://pith.science/api/pith-number/NQWW6OS3YM4E6AOPL3CJMPKN5O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQWW6OS3YM4E6AOPL3CJMPKN5O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQWW6OS3YM4E6AOPL3CJMPKN5O/action/storage_attestation","attest_author":"https://pith.science/pith/NQWW6OS3YM4E6AOPL3CJMPKN5O/action/author_attestation","sign_citation":"https://pith.science/pith/NQWW6OS3YM4E6AOPL3CJMPKN5O/action/citation_signature","submit_replication":"https://pith.science/pith/NQWW6OS3YM4E6AOPL3CJMPKN5O/action/replication_record"}},"created_at":"2026-05-18T00:30:33.119635+00:00","updated_at":"2026-05-18T00:30:33.119635+00:00"}