{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:TSHGKNWEHXQXAYTKMF6SSMIDLG","short_pith_number":"pith:TSHGKNWE","schema_version":"1.0","canonical_sha256":"9c8e6536c43de170626a617d293103598eea68c5181adbe0dd43338f41d0f6fb","source":{"kind":"arxiv","id":"2104.01667","version":1},"attestation_state":"computed","paper":{"title":"A Logical Programming Language as an Instrument for Specifying and Verifying Dynamic Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.PL","cs.SC","cs.SE"],"primary_cat":"cs.LO","authors_text":"Ren\\'e Haberland","submitted_at":"2021-04-04T19:18:07Z","abstract_excerpt":"This work proposes a Prolog-dialect for the found and prioritised problems on expressibility and automation. Given some given C-like program, if dynamic memory is allocated, altered and freed on runtime, then a description of desired dynamic memory is a heap specification. The check of calculated memory state against a given specification is dynamic memory verification. This contribution only considers formal specification and verification in a Hoare calculus. Issues found include: invalid assignment, (temporary) unavailable data in memory cells, excessive memory allocation, (accidental) heap "},"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":"2104.01667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2021-04-04T19:18:07Z","cross_cats_sorted":["cs.FL","cs.PL","cs.SC","cs.SE"],"title_canon_sha256":"7c439e8ff7ae8bf33b453016ead370cd99da1263bb602acd08cf5fa2e036878f","abstract_canon_sha256":"a208ee5bb518dd8c39a25844d3acbe18d2431cfed082a710b2b542cf3d4abde0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:29:02.472818Z","signature_b64":"rcPCICmcYppaPh12a6kJMCICjEuYq09jpYVJ2YNrV1Cvoa4S2+daayIIYvuNYoSk/+aYcw4i3xk+NVo7f9tACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c8e6536c43de170626a617d293103598eea68c5181adbe0dd43338f41d0f6fb","last_reissued_at":"2026-07-05T02:29:02.472247Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:29:02.472247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Logical Programming Language as an Instrument for Specifying and Verifying Dynamic Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.PL","cs.SC","cs.SE"],"primary_cat":"cs.LO","authors_text":"Ren\\'e Haberland","submitted_at":"2021-04-04T19:18:07Z","abstract_excerpt":"This work proposes a Prolog-dialect for the found and prioritised problems on expressibility and automation. Given some given C-like program, if dynamic memory is allocated, altered and freed on runtime, then a description of desired dynamic memory is a heap specification. The check of calculated memory state against a given specification is dynamic memory verification. This contribution only considers formal specification and verification in a Hoare calculus. Issues found include: invalid assignment, (temporary) unavailable data in memory cells, excessive memory allocation, (accidental) heap "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.01667","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.01667/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2104.01667","created_at":"2026-07-05T02:29:02.472340+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.01667v1","created_at":"2026-07-05T02:29:02.472340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.01667","created_at":"2026-07-05T02:29:02.472340+00:00"},{"alias_kind":"pith_short_12","alias_value":"TSHGKNWEHXQX","created_at":"2026-07-05T02:29:02.472340+00:00"},{"alias_kind":"pith_short_16","alias_value":"TSHGKNWEHXQXAYTK","created_at":"2026-07-05T02:29:02.472340+00:00"},{"alias_kind":"pith_short_8","alias_value":"TSHGKNWE","created_at":"2026-07-05T02:29:02.472340+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/TSHGKNWEHXQXAYTKMF6SSMIDLG","json":"https://pith.science/pith/TSHGKNWEHXQXAYTKMF6SSMIDLG.json","graph_json":"https://pith.science/api/pith-number/TSHGKNWEHXQXAYTKMF6SSMIDLG/graph.json","events_json":"https://pith.science/api/pith-number/TSHGKNWEHXQXAYTKMF6SSMIDLG/events.json","paper":"https://pith.science/paper/TSHGKNWE"},"agent_actions":{"view_html":"https://pith.science/pith/TSHGKNWEHXQXAYTKMF6SSMIDLG","download_json":"https://pith.science/pith/TSHGKNWEHXQXAYTKMF6SSMIDLG.json","view_paper":"https://pith.science/paper/TSHGKNWE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.01667&json=true","fetch_graph":"https://pith.science/api/pith-number/TSHGKNWEHXQXAYTKMF6SSMIDLG/graph.json","fetch_events":"https://pith.science/api/pith-number/TSHGKNWEHXQXAYTKMF6SSMIDLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TSHGKNWEHXQXAYTKMF6SSMIDLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TSHGKNWEHXQXAYTKMF6SSMIDLG/action/storage_attestation","attest_author":"https://pith.science/pith/TSHGKNWEHXQXAYTKMF6SSMIDLG/action/author_attestation","sign_citation":"https://pith.science/pith/TSHGKNWEHXQXAYTKMF6SSMIDLG/action/citation_signature","submit_replication":"https://pith.science/pith/TSHGKNWEHXQXAYTKMF6SSMIDLG/action/replication_record"}},"created_at":"2026-07-05T02:29:02.472340+00:00","updated_at":"2026-07-05T02:29:02.472340+00:00"}