{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3ETC3VCNNBRI3L64ZHIFCQ7H7Y","short_pith_number":"pith:3ETC3VCN","schema_version":"1.0","canonical_sha256":"d9262dd44d68628dafdcc9d05143e7fe2d7ec522bcd140e2281a2575c05946cc","source":{"kind":"arxiv","id":"1710.08614","version":2},"attestation_state":"computed","paper":{"title":"Higher-Order Program Verification via HFL Model Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Keiichi Watanabe, Naoki Kobayashi, Takeshi Tsukada","submitted_at":"2017-10-24T06:25:05Z","abstract_excerpt":"There are two kinds of higher-order extensions of model checking: HORS model checking and HFL model checking. Whilst the former has been applied to automated verification of higher-order functional programs, applications of the latter have not been well studied. In the present paper, we show that various verification problems for functional programs, including may/must-reachability, trace properties, and linear-time temporal properties (and their negations), can be naturally reduced to (extended) HFL model checking. The reductions yield a sound and complete logical characterization of those pr"},"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":"1710.08614","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-10-24T06:25:05Z","cross_cats_sorted":[],"title_canon_sha256":"66a6f549c571f50a43d75127b5541c52395b78ca6fd2019551de27f911460163","abstract_canon_sha256":"9498bdf13ef03982b68e79e0e1f11c8845831b5221056702e4d0936ee20d1a66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:20.618096Z","signature_b64":"l2OzpjIHF0Xvs0se49r0GNo1GKxEQRr08lRda3JlvfdNXUg3sd90R/1UtOkslMQqEb+Uq/QhZ+UoP7vxnWEdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9262dd44d68628dafdcc9d05143e7fe2d7ec522bcd140e2281a2575c05946cc","last_reissued_at":"2026-05-18T00:22:20.617550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:20.617550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher-Order Program Verification via HFL Model Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Keiichi Watanabe, Naoki Kobayashi, Takeshi Tsukada","submitted_at":"2017-10-24T06:25:05Z","abstract_excerpt":"There are two kinds of higher-order extensions of model checking: HORS model checking and HFL model checking. Whilst the former has been applied to automated verification of higher-order functional programs, applications of the latter have not been well studied. In the present paper, we show that various verification problems for functional programs, including may/must-reachability, trace properties, and linear-time temporal properties (and their negations), can be naturally reduced to (extended) HFL model checking. The reductions yield a sound and complete logical characterization of those pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08614","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":"1710.08614","created_at":"2026-05-18T00:22:20.617617+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.08614v2","created_at":"2026-05-18T00:22:20.617617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08614","created_at":"2026-05-18T00:22:20.617617+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ETC3VCNNBRI","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ETC3VCNNBRI3L64","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ETC3VCN","created_at":"2026-05-18T12:30:58.224056+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/3ETC3VCNNBRI3L64ZHIFCQ7H7Y","json":"https://pith.science/pith/3ETC3VCNNBRI3L64ZHIFCQ7H7Y.json","graph_json":"https://pith.science/api/pith-number/3ETC3VCNNBRI3L64ZHIFCQ7H7Y/graph.json","events_json":"https://pith.science/api/pith-number/3ETC3VCNNBRI3L64ZHIFCQ7H7Y/events.json","paper":"https://pith.science/paper/3ETC3VCN"},"agent_actions":{"view_html":"https://pith.science/pith/3ETC3VCNNBRI3L64ZHIFCQ7H7Y","download_json":"https://pith.science/pith/3ETC3VCNNBRI3L64ZHIFCQ7H7Y.json","view_paper":"https://pith.science/paper/3ETC3VCN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.08614&json=true","fetch_graph":"https://pith.science/api/pith-number/3ETC3VCNNBRI3L64ZHIFCQ7H7Y/graph.json","fetch_events":"https://pith.science/api/pith-number/3ETC3VCNNBRI3L64ZHIFCQ7H7Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ETC3VCNNBRI3L64ZHIFCQ7H7Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ETC3VCNNBRI3L64ZHIFCQ7H7Y/action/storage_attestation","attest_author":"https://pith.science/pith/3ETC3VCNNBRI3L64ZHIFCQ7H7Y/action/author_attestation","sign_citation":"https://pith.science/pith/3ETC3VCNNBRI3L64ZHIFCQ7H7Y/action/citation_signature","submit_replication":"https://pith.science/pith/3ETC3VCNNBRI3L64ZHIFCQ7H7Y/action/replication_record"}},"created_at":"2026-05-18T00:22:20.617617+00:00","updated_at":"2026-05-18T00:22:20.617617+00:00"}