{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5OK5XQOKCFBUK244DIHAJBUIFD","short_pith_number":"pith:5OK5XQOK","schema_version":"1.0","canonical_sha256":"eb95dbc1ca1143456b9c1a0e04868828ef2a7a6ff8468aa7ecd518ce8b4f8663","source":{"kind":"arxiv","id":"2302.02384","version":1},"attestation_state":"computed","paper":{"title":"CBMC: The C Bounded Model Checker","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO","cs.PL"],"primary_cat":"cs.SE","authors_text":"Daniel Kroening, Michael Tautschnig, Peter Schrammel","submitted_at":"2023-02-05T14:03:39Z","abstract_excerpt":"The C Bounded Model Checker (CBMC) demonstrates the violation of assertions in C programs, or proves safety of the assertions under a given bound. CBMC implements a bit-precise translation of an input C program, annotated with assertions and with loops unrolled to a given depth, into a formula. If the formula is satisfiable, then an execution leading to a violated assertion exists. CBMC is one of the most successful software verification tools. Its main advantages are its precision, robustness and simplicity. CBMC is shipped as part of several Linux distributions. It has been used by thousands"},"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":"2302.02384","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2023-02-05T14:03:39Z","cross_cats_sorted":["cs.LO","cs.PL"],"title_canon_sha256":"3301f3a88ebdb1ba8134d670e8c883bfc3353d2a30e4c8cb4e66061ff4ad11f7","abstract_canon_sha256":"b1b38a9d982226c6a1b2e21d8851b5d3e6a0131d1e95b3f0bdc5ca63f5f8174c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:38:52.813382Z","signature_b64":"lpXJd4OS6sK6PdClGRaJbo3Tvsz7dC2qNgVkgL3FCUOSvVfd1VS1xBTPSHHk90lOKTLB7bevPCuI5sI3G7ZQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb95dbc1ca1143456b9c1a0e04868828ef2a7a6ff8468aa7ecd518ce8b4f8663","last_reissued_at":"2026-07-05T05:38:52.812875Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:38:52.812875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CBMC: The C Bounded Model Checker","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO","cs.PL"],"primary_cat":"cs.SE","authors_text":"Daniel Kroening, Michael Tautschnig, Peter Schrammel","submitted_at":"2023-02-05T14:03:39Z","abstract_excerpt":"The C Bounded Model Checker (CBMC) demonstrates the violation of assertions in C programs, or proves safety of the assertions under a given bound. CBMC implements a bit-precise translation of an input C program, annotated with assertions and with loops unrolled to a given depth, into a formula. If the formula is satisfiable, then an execution leading to a violated assertion exists. CBMC is one of the most successful software verification tools. Its main advantages are its precision, robustness and simplicity. CBMC is shipped as part of several Linux distributions. It has been used by thousands"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.02384","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.02384/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2302.02384","created_at":"2026-07-05T05:38:52.812932+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.02384v1","created_at":"2026-07-05T05:38:52.812932+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.02384","created_at":"2026-07-05T05:38:52.812932+00:00"},{"alias_kind":"pith_short_12","alias_value":"5OK5XQOKCFBU","created_at":"2026-07-05T05:38:52.812932+00:00"},{"alias_kind":"pith_short_16","alias_value":"5OK5XQOKCFBUK244","created_at":"2026-07-05T05:38:52.812932+00:00"},{"alias_kind":"pith_short_8","alias_value":"5OK5XQOK","created_at":"2026-07-05T05:38:52.812932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01504","citing_title":"Kani: A Model Checker for Rust","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2505.12878","citing_title":"QCP: A Practical Separation Logic-based C Program Verification Tool","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5OK5XQOKCFBUK244DIHAJBUIFD","json":"https://pith.science/pith/5OK5XQOKCFBUK244DIHAJBUIFD.json","graph_json":"https://pith.science/api/pith-number/5OK5XQOKCFBUK244DIHAJBUIFD/graph.json","events_json":"https://pith.science/api/pith-number/5OK5XQOKCFBUK244DIHAJBUIFD/events.json","paper":"https://pith.science/paper/5OK5XQOK"},"agent_actions":{"view_html":"https://pith.science/pith/5OK5XQOKCFBUK244DIHAJBUIFD","download_json":"https://pith.science/pith/5OK5XQOKCFBUK244DIHAJBUIFD.json","view_paper":"https://pith.science/paper/5OK5XQOK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.02384&json=true","fetch_graph":"https://pith.science/api/pith-number/5OK5XQOKCFBUK244DIHAJBUIFD/graph.json","fetch_events":"https://pith.science/api/pith-number/5OK5XQOKCFBUK244DIHAJBUIFD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5OK5XQOKCFBUK244DIHAJBUIFD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5OK5XQOKCFBUK244DIHAJBUIFD/action/storage_attestation","attest_author":"https://pith.science/pith/5OK5XQOKCFBUK244DIHAJBUIFD/action/author_attestation","sign_citation":"https://pith.science/pith/5OK5XQOKCFBUK244DIHAJBUIFD/action/citation_signature","submit_replication":"https://pith.science/pith/5OK5XQOKCFBUK244DIHAJBUIFD/action/replication_record"}},"created_at":"2026-07-05T05:38:52.812932+00:00","updated_at":"2026-07-05T05:38:52.812932+00:00"}