{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LHYEJECU3MF73CYJQ7X3TNH6F4","short_pith_number":"pith:LHYEJECU","schema_version":"1.0","canonical_sha256":"59f0449054db0bfd8b0987efb9b4fe2f2c1eb476e8a20052fc539db592243e6f","source":{"kind":"arxiv","id":"1701.05888","version":1},"attestation_state":"computed","paper":{"title":"A Higher-Order Logic for Concurrent Termination-Preserving Refinement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Joseph Tassarotti, Ralf Jung, Robert Harper","submitted_at":"2017-01-20T18:42:43Z","abstract_excerpt":"Compiler correctness proofs for higher-order concurrent languages are difficult: they involve establishing a termination-preserving refinement between a concurrent high-level source language and an implementation that uses low-level shared memory primitives. However, existing logics for proving concurrent refinement either neglect properties such as termination, or only handle first-order state. In this paper, we address these limitations by extending Iris, a recent higher-order concurrent separation logic, with support for reasoning about termination-preserving refinements. To demonstrate the"},"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":"1701.05888","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-20T18:42:43Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"b583be164ac17f5ecca3bf81e4de6c8e69afb6344f8dc96ea9ba678646648c6b","abstract_canon_sha256":"5a6286972c00505594ed2d84ccf72acd1414463be137b11e710effb0d939bd5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:24.457271Z","signature_b64":"i8UQy67ABiupJBWjRvC50ucyoER4HNBAwp60cpN7/Blp+4Ix/kyXDuuAXLzKyPYFTION2T8OxjAXAjKOl2aqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59f0449054db0bfd8b0987efb9b4fe2f2c1eb476e8a20052fc539db592243e6f","last_reissued_at":"2026-05-18T00:52:24.456522Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:24.456522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Higher-Order Logic for Concurrent Termination-Preserving Refinement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Joseph Tassarotti, Ralf Jung, Robert Harper","submitted_at":"2017-01-20T18:42:43Z","abstract_excerpt":"Compiler correctness proofs for higher-order concurrent languages are difficult: they involve establishing a termination-preserving refinement between a concurrent high-level source language and an implementation that uses low-level shared memory primitives. However, existing logics for proving concurrent refinement either neglect properties such as termination, or only handle first-order state. In this paper, we address these limitations by extending Iris, a recent higher-order concurrent separation logic, with support for reasoning about termination-preserving refinements. To demonstrate the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05888","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":""},"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":"1701.05888","created_at":"2026-05-18T00:52:24.456655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.05888v1","created_at":"2026-05-18T00:52:24.456655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05888","created_at":"2026-05-18T00:52:24.456655+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHYEJECU3MF7","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHYEJECU3MF73CYJ","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHYEJECU","created_at":"2026-05-18T12:31:28.150371+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/LHYEJECU3MF73CYJQ7X3TNH6F4","json":"https://pith.science/pith/LHYEJECU3MF73CYJQ7X3TNH6F4.json","graph_json":"https://pith.science/api/pith-number/LHYEJECU3MF73CYJQ7X3TNH6F4/graph.json","events_json":"https://pith.science/api/pith-number/LHYEJECU3MF73CYJQ7X3TNH6F4/events.json","paper":"https://pith.science/paper/LHYEJECU"},"agent_actions":{"view_html":"https://pith.science/pith/LHYEJECU3MF73CYJQ7X3TNH6F4","download_json":"https://pith.science/pith/LHYEJECU3MF73CYJQ7X3TNH6F4.json","view_paper":"https://pith.science/paper/LHYEJECU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.05888&json=true","fetch_graph":"https://pith.science/api/pith-number/LHYEJECU3MF73CYJQ7X3TNH6F4/graph.json","fetch_events":"https://pith.science/api/pith-number/LHYEJECU3MF73CYJQ7X3TNH6F4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHYEJECU3MF73CYJQ7X3TNH6F4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHYEJECU3MF73CYJQ7X3TNH6F4/action/storage_attestation","attest_author":"https://pith.science/pith/LHYEJECU3MF73CYJQ7X3TNH6F4/action/author_attestation","sign_citation":"https://pith.science/pith/LHYEJECU3MF73CYJQ7X3TNH6F4/action/citation_signature","submit_replication":"https://pith.science/pith/LHYEJECU3MF73CYJQ7X3TNH6F4/action/replication_record"}},"created_at":"2026-05-18T00:52:24.456655+00:00","updated_at":"2026-05-18T00:52:24.456655+00:00"}