{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZUXBM5CXNI7DKTCJ3F5TMPYPED","short_pith_number":"pith:ZUXBM5CX","schema_version":"1.0","canonical_sha256":"cd2e1674576a3e354c49d97b363f0f20e7755093621c2635784b2378c3ade3dc","source":{"kind":"arxiv","id":"1306.1945","version":1},"attestation_state":"computed","paper":{"title":"Automatic Abstraction in SMT-Based Unbounded Software Model Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Anvesh Komuravelli, Arie Gurfinkel, Edmund M. Clarke, Sagar Chaki","submitted_at":"2013-06-08T18:41:28Z","abstract_excerpt":"Software model checkers based on under-approximations and SMT solvers are very successful at verifying safety (i.e. reachability) properties. They combine two key ideas -- (a) \"concreteness\": a counterexample in an under-approximation is a counterexample in the original program as well, and (b) \"generalization\": a proof of safety of an under-approximation, produced by an SMT solver, are generalizable to proofs of safety of the original program. In this paper, we present a combination of \"automatic abstraction\" with the under-approximation-driven framework. We explore two iterative approaches f"},"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":"1306.1945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-06-08T18:41:28Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"e01c5980158d14ad75ce6ab6582bd6cce3bdc0f047dc9b05e9c6572823cf2446","abstract_canon_sha256":"33d84fbc1c1144231e275724052181384d6988dba1c5859e924ee2f5b4d1f27c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:22.803345Z","signature_b64":"dFHCmohDdqIv+9eZSYV+whCXevv0yr4On8wsfvpCYzJ3mKdbkDC1pqoYNcTAhDbki6HRGMXnWcLXN38QWYYiBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd2e1674576a3e354c49d97b363f0f20e7755093621c2635784b2378c3ade3dc","last_reissued_at":"2026-05-18T03:21:22.802627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:22.802627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatic Abstraction in SMT-Based Unbounded Software Model Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Anvesh Komuravelli, Arie Gurfinkel, Edmund M. Clarke, Sagar Chaki","submitted_at":"2013-06-08T18:41:28Z","abstract_excerpt":"Software model checkers based on under-approximations and SMT solvers are very successful at verifying safety (i.e. reachability) properties. They combine two key ideas -- (a) \"concreteness\": a counterexample in an under-approximation is a counterexample in the original program as well, and (b) \"generalization\": a proof of safety of an under-approximation, produced by an SMT solver, are generalizable to proofs of safety of the original program. In this paper, we present a combination of \"automatic abstraction\" with the under-approximation-driven framework. We explore two iterative approaches f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1945","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":"1306.1945","created_at":"2026-05-18T03:21:22.802722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.1945v1","created_at":"2026-05-18T03:21:22.802722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1945","created_at":"2026-05-18T03:21:22.802722+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZUXBM5CXNI7D","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZUXBM5CXNI7DKTCJ","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZUXBM5CX","created_at":"2026-05-18T12:28:09.283467+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/ZUXBM5CXNI7DKTCJ3F5TMPYPED","json":"https://pith.science/pith/ZUXBM5CXNI7DKTCJ3F5TMPYPED.json","graph_json":"https://pith.science/api/pith-number/ZUXBM5CXNI7DKTCJ3F5TMPYPED/graph.json","events_json":"https://pith.science/api/pith-number/ZUXBM5CXNI7DKTCJ3F5TMPYPED/events.json","paper":"https://pith.science/paper/ZUXBM5CX"},"agent_actions":{"view_html":"https://pith.science/pith/ZUXBM5CXNI7DKTCJ3F5TMPYPED","download_json":"https://pith.science/pith/ZUXBM5CXNI7DKTCJ3F5TMPYPED.json","view_paper":"https://pith.science/paper/ZUXBM5CX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.1945&json=true","fetch_graph":"https://pith.science/api/pith-number/ZUXBM5CXNI7DKTCJ3F5TMPYPED/graph.json","fetch_events":"https://pith.science/api/pith-number/ZUXBM5CXNI7DKTCJ3F5TMPYPED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZUXBM5CXNI7DKTCJ3F5TMPYPED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZUXBM5CXNI7DKTCJ3F5TMPYPED/action/storage_attestation","attest_author":"https://pith.science/pith/ZUXBM5CXNI7DKTCJ3F5TMPYPED/action/author_attestation","sign_citation":"https://pith.science/pith/ZUXBM5CXNI7DKTCJ3F5TMPYPED/action/citation_signature","submit_replication":"https://pith.science/pith/ZUXBM5CXNI7DKTCJ3F5TMPYPED/action/replication_record"}},"created_at":"2026-05-18T03:21:22.802722+00:00","updated_at":"2026-05-18T03:21:22.802722+00:00"}