{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SOVCBMVDNLLGZZMLPCI23BBPBZ","short_pith_number":"pith:SOVCBMVD","schema_version":"1.0","canonical_sha256":"93aa20b2a36ad66ce58b7891ad842f0e6929097aff9f2871dc9673ba02a821a8","source":{"kind":"arxiv","id":"1508.01288","version":1},"attestation_state":"computed","paper":{"title":"Compositional Verification of Procedural Programs using Horn Clauses over Integers and Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL","cs.SE"],"primary_cat":"cs.LO","authors_text":"Anvesh Komuravelli, Arie Gurfinkel, Kenneth L. McMillan, Nikolaj Bjorner","submitted_at":"2015-08-06T06:27:27Z","abstract_excerpt":"We present a compositional SMT-based algorithm for safety of procedural C programs that takes the heap into consideration as well. Existing SMT-based approaches are either largely restricted to handling linear arithmetic operations and properties, or are non-compositional. We use Constrained Horn Clauses (CHCs) to represent the verification conditions where the memory operations are modeled using the extensional theory of arrays (ARR). First, we describe an exponential time quantifier elimination (QE) algorithm for ARR which can introduce new quantifiers of the index and value sorts. Second, w"},"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":"1508.01288","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-08-06T06:27:27Z","cross_cats_sorted":["cs.PL","cs.SE"],"title_canon_sha256":"3529d5d8377bed134b13b54be740e0b0e7c99790eba3a52168eeaf1673e5f963","abstract_canon_sha256":"8e2d72de698d611af1128cdd97ef030a534fedc14d7a84c52c47aed44af7f7c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:42.979821Z","signature_b64":"2a9BQgkheYUIjxlggFTdQxnXanPsPO4xONGQIjCUOnjctIsmHYU7BJcQYCGLhNAhuK3PqrvO/7pEHedr2iTUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93aa20b2a36ad66ce58b7891ad842f0e6929097aff9f2871dc9673ba02a821a8","last_reissued_at":"2026-05-18T01:35:42.979238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:42.979238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compositional Verification of Procedural Programs using Horn Clauses over Integers and Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL","cs.SE"],"primary_cat":"cs.LO","authors_text":"Anvesh Komuravelli, Arie Gurfinkel, Kenneth L. McMillan, Nikolaj Bjorner","submitted_at":"2015-08-06T06:27:27Z","abstract_excerpt":"We present a compositional SMT-based algorithm for safety of procedural C programs that takes the heap into consideration as well. Existing SMT-based approaches are either largely restricted to handling linear arithmetic operations and properties, or are non-compositional. We use Constrained Horn Clauses (CHCs) to represent the verification conditions where the memory operations are modeled using the extensional theory of arrays (ARR). First, we describe an exponential time quantifier elimination (QE) algorithm for ARR which can introduce new quantifiers of the index and value sorts. Second, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01288","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":"1508.01288","created_at":"2026-05-18T01:35:42.979328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.01288v1","created_at":"2026-05-18T01:35:42.979328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01288","created_at":"2026-05-18T01:35:42.979328+00:00"},{"alias_kind":"pith_short_12","alias_value":"SOVCBMVDNLLG","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SOVCBMVDNLLGZZML","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SOVCBMVD","created_at":"2026-05-18T12:29:42.218222+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/SOVCBMVDNLLGZZMLPCI23BBPBZ","json":"https://pith.science/pith/SOVCBMVDNLLGZZMLPCI23BBPBZ.json","graph_json":"https://pith.science/api/pith-number/SOVCBMVDNLLGZZMLPCI23BBPBZ/graph.json","events_json":"https://pith.science/api/pith-number/SOVCBMVDNLLGZZMLPCI23BBPBZ/events.json","paper":"https://pith.science/paper/SOVCBMVD"},"agent_actions":{"view_html":"https://pith.science/pith/SOVCBMVDNLLGZZMLPCI23BBPBZ","download_json":"https://pith.science/pith/SOVCBMVDNLLGZZMLPCI23BBPBZ.json","view_paper":"https://pith.science/paper/SOVCBMVD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.01288&json=true","fetch_graph":"https://pith.science/api/pith-number/SOVCBMVDNLLGZZMLPCI23BBPBZ/graph.json","fetch_events":"https://pith.science/api/pith-number/SOVCBMVDNLLGZZMLPCI23BBPBZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SOVCBMVDNLLGZZMLPCI23BBPBZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SOVCBMVDNLLGZZMLPCI23BBPBZ/action/storage_attestation","attest_author":"https://pith.science/pith/SOVCBMVDNLLGZZMLPCI23BBPBZ/action/author_attestation","sign_citation":"https://pith.science/pith/SOVCBMVDNLLGZZMLPCI23BBPBZ/action/citation_signature","submit_replication":"https://pith.science/pith/SOVCBMVDNLLGZZMLPCI23BBPBZ/action/replication_record"}},"created_at":"2026-05-18T01:35:42.979328+00:00","updated_at":"2026-05-18T01:35:42.979328+00:00"}