{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TYQMUUDF5XPY5GQLIVQXWCQV27","short_pith_number":"pith:TYQMUUDF","schema_version":"1.0","canonical_sha256":"9e20ca5065eddf8e9a0b45617b0a15d7d4138a37106d0b73216358254eeab9e3","source":{"kind":"arxiv","id":"1704.04558","version":1},"attestation_state":"computed","paper":{"title":"Verifying Safety of Functional Programs with Rosette/Unbound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Dmitry Mordvinov, Grigory Fedyukovich","submitted_at":"2017-04-15T00:07:31Z","abstract_excerpt":"The goal of unbounded program verification is to discover an inductive invariant that safely over-approximates all possible program behaviors. Functional languages featuring higher order and recursive functions become more popular due to the domain-specific needs of big data analytics, web, and security. We present Rosette/Unbound, the first program verifier for Racket exploiting the automated constrained Horn solver on its backend. One of the key features of Rosette/Unbound is the ability to synchronize recursive computations over the same inputs allowing to verify programs that iterate over "},"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":"1704.04558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-04-15T00:07:31Z","cross_cats_sorted":[],"title_canon_sha256":"ae8ceec7edee8a092f548ba7d8a71876a9849cfc9cd90a2bb044390e4f99d841","abstract_canon_sha256":"d6ba6e64174ac6a3982c377d818e5040f6b9ad2c0553c72654cbc7a55d921e43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:18.190664Z","signature_b64":"HmEirolO4dcxgeiqy7OOLxFkmdziw7y033pas7B8Z1ed2W2iSpsXbFI1i4X/2RbVH0Ac1TDKPsVlRHQN7lQgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e20ca5065eddf8e9a0b45617b0a15d7d4138a37106d0b73216358254eeab9e3","last_reissued_at":"2026-05-18T00:46:18.190276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:18.190276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Verifying Safety of Functional Programs with Rosette/Unbound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Dmitry Mordvinov, Grigory Fedyukovich","submitted_at":"2017-04-15T00:07:31Z","abstract_excerpt":"The goal of unbounded program verification is to discover an inductive invariant that safely over-approximates all possible program behaviors. Functional languages featuring higher order and recursive functions become more popular due to the domain-specific needs of big data analytics, web, and security. We present Rosette/Unbound, the first program verifier for Racket exploiting the automated constrained Horn solver on its backend. One of the key features of Rosette/Unbound is the ability to synchronize recursive computations over the same inputs allowing to verify programs that iterate over "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04558","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":"1704.04558","created_at":"2026-05-18T00:46:18.190344+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.04558v1","created_at":"2026-05-18T00:46:18.190344+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04558","created_at":"2026-05-18T00:46:18.190344+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYQMUUDF5XPY","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYQMUUDF5XPY5GQL","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYQMUUDF","created_at":"2026-05-18T12:31:46.661854+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/TYQMUUDF5XPY5GQLIVQXWCQV27","json":"https://pith.science/pith/TYQMUUDF5XPY5GQLIVQXWCQV27.json","graph_json":"https://pith.science/api/pith-number/TYQMUUDF5XPY5GQLIVQXWCQV27/graph.json","events_json":"https://pith.science/api/pith-number/TYQMUUDF5XPY5GQLIVQXWCQV27/events.json","paper":"https://pith.science/paper/TYQMUUDF"},"agent_actions":{"view_html":"https://pith.science/pith/TYQMUUDF5XPY5GQLIVQXWCQV27","download_json":"https://pith.science/pith/TYQMUUDF5XPY5GQLIVQXWCQV27.json","view_paper":"https://pith.science/paper/TYQMUUDF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.04558&json=true","fetch_graph":"https://pith.science/api/pith-number/TYQMUUDF5XPY5GQLIVQXWCQV27/graph.json","fetch_events":"https://pith.science/api/pith-number/TYQMUUDF5XPY5GQLIVQXWCQV27/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYQMUUDF5XPY5GQLIVQXWCQV27/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYQMUUDF5XPY5GQLIVQXWCQV27/action/storage_attestation","attest_author":"https://pith.science/pith/TYQMUUDF5XPY5GQLIVQXWCQV27/action/author_attestation","sign_citation":"https://pith.science/pith/TYQMUUDF5XPY5GQLIVQXWCQV27/action/citation_signature","submit_replication":"https://pith.science/pith/TYQMUUDF5XPY5GQLIVQXWCQV27/action/replication_record"}},"created_at":"2026-05-18T00:46:18.190344+00:00","updated_at":"2026-05-18T00:46:18.190344+00:00"}