{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2JUO2R5BN5E7G3Q34KZQGSR7N4","short_pith_number":"pith:2JUO2R5B","schema_version":"1.0","canonical_sha256":"d268ed47a16f49f36e1be2b3034a3f6f35f95470bb0ed917f860e36e24a2c081","source":{"kind":"arxiv","id":"1803.00403","version":3},"attestation_state":"computed","paper":{"title":"A general formal memory framework in Coq for verifying the properties of programs based on higher-order logic theorem proving with increased automation, consistency, and reusability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Hang Lei, Zheng Yang","submitted_at":"2018-02-23T02:45:34Z","abstract_excerpt":"In recent years, a number of lightweight programs have been deployed in critical domains, such as in smart contracts based on blockchain technology. Therefore, the security and reliability of such programs should be guaranteed by the most credible technology. Higher-order logic theorem proving is one of the most reliable technologies for verifying the properties of programs. However, programs may be developed by different high-level programming languages, and a general, extensible, and reusable formal memory (GERM) framework that can simultaneously support different formal verification specifi"},"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":"1803.00403","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-02-23T02:45:34Z","cross_cats_sorted":[],"title_canon_sha256":"cfa49b8b901227d0b9097907c6f0a88432eea217ae0f04ee0f61c7ab5e29ad60","abstract_canon_sha256":"c2f92e8959913a307b85995396d0c83c9dac501a6f78e6ee1e40029186ba272d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:01.863506Z","signature_b64":"qwiT4s4qFakVEXI3zmk7rT7+wBsqMvnEKH99vuce9W3PP/cW7G0CpEualCGUuCpulP3g5NhyLiXaK3GickoGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d268ed47a16f49f36e1be2b3034a3f6f35f95470bb0ed917f860e36e24a2c081","last_reissued_at":"2026-05-18T00:20:01.862863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:01.862863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A general formal memory framework in Coq for verifying the properties of programs based on higher-order logic theorem proving with increased automation, consistency, and reusability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Hang Lei, Zheng Yang","submitted_at":"2018-02-23T02:45:34Z","abstract_excerpt":"In recent years, a number of lightweight programs have been deployed in critical domains, such as in smart contracts based on blockchain technology. Therefore, the security and reliability of such programs should be guaranteed by the most credible technology. Higher-order logic theorem proving is one of the most reliable technologies for verifying the properties of programs. However, programs may be developed by different high-level programming languages, and a general, extensible, and reusable formal memory (GERM) framework that can simultaneously support different formal verification specifi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00403","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":"1803.00403","created_at":"2026-05-18T00:20:01.862946+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.00403v3","created_at":"2026-05-18T00:20:01.862946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00403","created_at":"2026-05-18T00:20:01.862946+00:00"},{"alias_kind":"pith_short_12","alias_value":"2JUO2R5BN5E7","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2JUO2R5BN5E7G3Q3","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2JUO2R5B","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/2JUO2R5BN5E7G3Q34KZQGSR7N4","json":"https://pith.science/pith/2JUO2R5BN5E7G3Q34KZQGSR7N4.json","graph_json":"https://pith.science/api/pith-number/2JUO2R5BN5E7G3Q34KZQGSR7N4/graph.json","events_json":"https://pith.science/api/pith-number/2JUO2R5BN5E7G3Q34KZQGSR7N4/events.json","paper":"https://pith.science/paper/2JUO2R5B"},"agent_actions":{"view_html":"https://pith.science/pith/2JUO2R5BN5E7G3Q34KZQGSR7N4","download_json":"https://pith.science/pith/2JUO2R5BN5E7G3Q34KZQGSR7N4.json","view_paper":"https://pith.science/paper/2JUO2R5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.00403&json=true","fetch_graph":"https://pith.science/api/pith-number/2JUO2R5BN5E7G3Q34KZQGSR7N4/graph.json","fetch_events":"https://pith.science/api/pith-number/2JUO2R5BN5E7G3Q34KZQGSR7N4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2JUO2R5BN5E7G3Q34KZQGSR7N4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2JUO2R5BN5E7G3Q34KZQGSR7N4/action/storage_attestation","attest_author":"https://pith.science/pith/2JUO2R5BN5E7G3Q34KZQGSR7N4/action/author_attestation","sign_citation":"https://pith.science/pith/2JUO2R5BN5E7G3Q34KZQGSR7N4/action/citation_signature","submit_replication":"https://pith.science/pith/2JUO2R5BN5E7G3Q34KZQGSR7N4/action/replication_record"}},"created_at":"2026-05-18T00:20:01.862946+00:00","updated_at":"2026-05-18T00:20:01.862946+00:00"}