{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AT3ZNIYX6XHZBSN3C4M7RTQCX3","short_pith_number":"pith:AT3ZNIYX","schema_version":"1.0","canonical_sha256":"04f796a317f5cf90c9bb1719f8ce02bed1ad2071aecea2be21455dd4ad9af974","source":{"kind":"arxiv","id":"2107.01093","version":1},"attestation_state":"computed","paper":{"title":"Model Checking C++ Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Felipe R. Monteiro, Lucas C. Cordeiro, Mikhail R. Gadelha","submitted_at":"2021-07-02T14:14:21Z","abstract_excerpt":"In the last three decades, memory safety issues in system programming languages such as C or C++ have been one of the significant sources of security vulnerabilities. However, there exist only a few attempts with limited success to cope with the complexity of C++ program verification. Here we describe and evaluate a novel verification approach based on bounded model checking (BMC) and satisfiability modulo theories (SMT) to verify C++ programs formally. Our verification approach analyzes bounded C++ programs by encoding into SMT various sophisticated features that the C++ programming language "},"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":"2107.01093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2021-07-02T14:14:21Z","cross_cats_sorted":[],"title_canon_sha256":"791c7ca6ba5020308b5f9119a9910a0cdaa6dd07083c8ab8f78d1e4096ceed88","abstract_canon_sha256":"acf17bebc044e0cd090a863e1f58ae10a989bdb783b590089d109b7a9962ae3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:54:37.026292Z","signature_b64":"Rczob05PTX+95kjYVp2Og3DvTF2MBq7/8eSRUs2KZYHIslIow6alrIN6YfwbAKmywKTv4J9uCktCI7tltBLYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04f796a317f5cf90c9bb1719f8ce02bed1ad2071aecea2be21455dd4ad9af974","last_reissued_at":"2026-07-05T02:54:37.025884Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:54:37.025884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model Checking C++ Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Felipe R. Monteiro, Lucas C. Cordeiro, Mikhail R. Gadelha","submitted_at":"2021-07-02T14:14:21Z","abstract_excerpt":"In the last three decades, memory safety issues in system programming languages such as C or C++ have been one of the significant sources of security vulnerabilities. However, there exist only a few attempts with limited success to cope with the complexity of C++ program verification. Here we describe and evaluate a novel verification approach based on bounded model checking (BMC) and satisfiability modulo theories (SMT) to verify C++ programs formally. Our verification approach analyzes bounded C++ programs by encoding into SMT various sophisticated features that the C++ programming language "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.01093","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/2107.01093/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":"2107.01093","created_at":"2026-07-05T02:54:37.025944+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.01093v1","created_at":"2026-07-05T02:54:37.025944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.01093","created_at":"2026-07-05T02:54:37.025944+00:00"},{"alias_kind":"pith_short_12","alias_value":"AT3ZNIYX6XHZ","created_at":"2026-07-05T02:54:37.025944+00:00"},{"alias_kind":"pith_short_16","alias_value":"AT3ZNIYX6XHZBSN3","created_at":"2026-07-05T02:54:37.025944+00:00"},{"alias_kind":"pith_short_8","alias_value":"AT3ZNIYX","created_at":"2026-07-05T02:54:37.025944+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/AT3ZNIYX6XHZBSN3C4M7RTQCX3","json":"https://pith.science/pith/AT3ZNIYX6XHZBSN3C4M7RTQCX3.json","graph_json":"https://pith.science/api/pith-number/AT3ZNIYX6XHZBSN3C4M7RTQCX3/graph.json","events_json":"https://pith.science/api/pith-number/AT3ZNIYX6XHZBSN3C4M7RTQCX3/events.json","paper":"https://pith.science/paper/AT3ZNIYX"},"agent_actions":{"view_html":"https://pith.science/pith/AT3ZNIYX6XHZBSN3C4M7RTQCX3","download_json":"https://pith.science/pith/AT3ZNIYX6XHZBSN3C4M7RTQCX3.json","view_paper":"https://pith.science/paper/AT3ZNIYX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.01093&json=true","fetch_graph":"https://pith.science/api/pith-number/AT3ZNIYX6XHZBSN3C4M7RTQCX3/graph.json","fetch_events":"https://pith.science/api/pith-number/AT3ZNIYX6XHZBSN3C4M7RTQCX3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AT3ZNIYX6XHZBSN3C4M7RTQCX3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AT3ZNIYX6XHZBSN3C4M7RTQCX3/action/storage_attestation","attest_author":"https://pith.science/pith/AT3ZNIYX6XHZBSN3C4M7RTQCX3/action/author_attestation","sign_citation":"https://pith.science/pith/AT3ZNIYX6XHZBSN3C4M7RTQCX3/action/citation_signature","submit_replication":"https://pith.science/pith/AT3ZNIYX6XHZBSN3C4M7RTQCX3/action/replication_record"}},"created_at":"2026-07-05T02:54:37.025944+00:00","updated_at":"2026-07-05T02:54:37.025944+00:00"}