{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5W6NZL4TB2VJD7ASBP6ZGNE74C","short_pith_number":"pith:5W6NZL4T","schema_version":"1.0","canonical_sha256":"edbcdcaf930eaa91fc120bfd93349fe0a1bcfe9da6a3bf4e2b9f7fc8f511852a","source":{"kind":"arxiv","id":"1412.1151","version":1},"attestation_state":"computed","paper":{"title":"Verification of Programs by Combining Iterated Specialization with Interpolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.LO","authors_text":"Emanuele De Angelis, Fabio Fioravanti, Jorge A. Navas, Maurizio Proietti","submitted_at":"2014-12-03T01:39:18Z","abstract_excerpt":"We present a verification technique for program safety that combines Iterated Specialization and Interpolating Horn Clause Solving. Our new method composes together these two techniques in a modular way by exploiting the common Horn Clause representation of the verification problem. The Iterated Specialization verifier transforms an initial set of verification conditions by using unfold/fold equivalence preserving transformation rules. During transformation, program invariants are discovered by applying widening operators. Then the output set of specialized verification conditions is analyzed "},"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":"1412.1151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-12-03T01:39:18Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"a58ff6f9ebbb2b3a1acb9631b2626ed638b03393ee1bf3735e95616635fd3c73","abstract_canon_sha256":"7dc4e0f9c0c3882eefe6cd043d20161467cdf8eaa95f7fea23becb1fdf263e37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:13.317360Z","signature_b64":"gve/4CRCv+td/IMXvWY+Q/DWe13E4IpxCwx3pwkK67zNUtQ2Eov/gMQZxlKj7wGLJyk1TYV3rUj65blxl4U9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edbcdcaf930eaa91fc120bfd93349fe0a1bcfe9da6a3bf4e2b9f7fc8f511852a","last_reissued_at":"2026-05-18T02:32:13.316864Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:13.316864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Verification of Programs by Combining Iterated Specialization with Interpolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.LO","authors_text":"Emanuele De Angelis, Fabio Fioravanti, Jorge A. Navas, Maurizio Proietti","submitted_at":"2014-12-03T01:39:18Z","abstract_excerpt":"We present a verification technique for program safety that combines Iterated Specialization and Interpolating Horn Clause Solving. Our new method composes together these two techniques in a modular way by exploiting the common Horn Clause representation of the verification problem. The Iterated Specialization verifier transforms an initial set of verification conditions by using unfold/fold equivalence preserving transformation rules. During transformation, program invariants are discovered by applying widening operators. Then the output set of specialized verification conditions is analyzed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1151","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":"1412.1151","created_at":"2026-05-18T02:32:13.316929+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.1151v1","created_at":"2026-05-18T02:32:13.316929+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1151","created_at":"2026-05-18T02:32:13.316929+00:00"},{"alias_kind":"pith_short_12","alias_value":"5W6NZL4TB2VJ","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"5W6NZL4TB2VJD7AS","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"5W6NZL4T","created_at":"2026-05-18T12:28:16.859392+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/5W6NZL4TB2VJD7ASBP6ZGNE74C","json":"https://pith.science/pith/5W6NZL4TB2VJD7ASBP6ZGNE74C.json","graph_json":"https://pith.science/api/pith-number/5W6NZL4TB2VJD7ASBP6ZGNE74C/graph.json","events_json":"https://pith.science/api/pith-number/5W6NZL4TB2VJD7ASBP6ZGNE74C/events.json","paper":"https://pith.science/paper/5W6NZL4T"},"agent_actions":{"view_html":"https://pith.science/pith/5W6NZL4TB2VJD7ASBP6ZGNE74C","download_json":"https://pith.science/pith/5W6NZL4TB2VJD7ASBP6ZGNE74C.json","view_paper":"https://pith.science/paper/5W6NZL4T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.1151&json=true","fetch_graph":"https://pith.science/api/pith-number/5W6NZL4TB2VJD7ASBP6ZGNE74C/graph.json","fetch_events":"https://pith.science/api/pith-number/5W6NZL4TB2VJD7ASBP6ZGNE74C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5W6NZL4TB2VJD7ASBP6ZGNE74C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5W6NZL4TB2VJD7ASBP6ZGNE74C/action/storage_attestation","attest_author":"https://pith.science/pith/5W6NZL4TB2VJD7ASBP6ZGNE74C/action/author_attestation","sign_citation":"https://pith.science/pith/5W6NZL4TB2VJD7ASBP6ZGNE74C/action/citation_signature","submit_replication":"https://pith.science/pith/5W6NZL4TB2VJD7ASBP6ZGNE74C/action/replication_record"}},"created_at":"2026-05-18T02:32:13.316929+00:00","updated_at":"2026-05-18T02:32:13.316929+00:00"}