{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KMDIMBTDUVUG2WMZ3GMPLVKHON","short_pith_number":"pith:KMDIMBTD","schema_version":"1.0","canonical_sha256":"5306860663a5686d5999d998f5d547737ea5a6c8e3f20c7645f3d04ed57bc3fe","source":{"kind":"arxiv","id":"1502.02327","version":1},"attestation_state":"computed","paper":{"title":"Model Checking C Programs with Loops via k-Induction and Invariants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.LO","authors_text":"Herbert Rocha, Hussama Ismail, Lucas Cordeiro, Raimundo Barreto","submitted_at":"2015-02-09T01:37:48Z","abstract_excerpt":"We present a novel proof by induction algorithm, which combines k-induction with invariants to model check C programs with bounded and unbounded loops. The k-induction algorithm consists of three cases: in the base case, we aim to find a counterexample with up to k loop unwindings; in the forward condition, we check whether loops have been fully unrolled and that the safety property P holds in all states reachable within k unwindings; and in the inductive step, we check that whenever P holds for k unwindings, it also holds after the next unwinding of the system. For each step of the k-inductio"},"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":"1502.02327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-02-09T01:37:48Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"d5b624419a87cef28d201eeb76c9ab9590d80bc47d5f0153a3b17453545a670d","abstract_canon_sha256":"c1444acbf295d91433dc87a4bf1bfee2dc02b7a05f68d686b30658db3839ea32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:42.860586Z","signature_b64":"ddn7FSjtMv6xKgHwrPd6bnx6LnFoyyUPfXZL5qKxFqEuv4ulQ7qkRcswGO/UmvitsAUXx7yUXG+SOi7I+ZjYCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5306860663a5686d5999d998f5d547737ea5a6c8e3f20c7645f3d04ed57bc3fe","last_reissued_at":"2026-05-18T02:27:42.859813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:42.859813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model Checking C Programs with Loops via k-Induction and Invariants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.LO","authors_text":"Herbert Rocha, Hussama Ismail, Lucas Cordeiro, Raimundo Barreto","submitted_at":"2015-02-09T01:37:48Z","abstract_excerpt":"We present a novel proof by induction algorithm, which combines k-induction with invariants to model check C programs with bounded and unbounded loops. The k-induction algorithm consists of three cases: in the base case, we aim to find a counterexample with up to k loop unwindings; in the forward condition, we check whether loops have been fully unrolled and that the safety property P holds in all states reachable within k unwindings; and in the inductive step, we check that whenever P holds for k unwindings, it also holds after the next unwinding of the system. For each step of the k-inductio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02327","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":"1502.02327","created_at":"2026-05-18T02:27:42.859925+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02327v1","created_at":"2026-05-18T02:27:42.859925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02327","created_at":"2026-05-18T02:27:42.859925+00:00"},{"alias_kind":"pith_short_12","alias_value":"KMDIMBTDUVUG","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KMDIMBTDUVUG2WMZ","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KMDIMBTD","created_at":"2026-05-18T12:29:29.992203+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/KMDIMBTDUVUG2WMZ3GMPLVKHON","json":"https://pith.science/pith/KMDIMBTDUVUG2WMZ3GMPLVKHON.json","graph_json":"https://pith.science/api/pith-number/KMDIMBTDUVUG2WMZ3GMPLVKHON/graph.json","events_json":"https://pith.science/api/pith-number/KMDIMBTDUVUG2WMZ3GMPLVKHON/events.json","paper":"https://pith.science/paper/KMDIMBTD"},"agent_actions":{"view_html":"https://pith.science/pith/KMDIMBTDUVUG2WMZ3GMPLVKHON","download_json":"https://pith.science/pith/KMDIMBTDUVUG2WMZ3GMPLVKHON.json","view_paper":"https://pith.science/paper/KMDIMBTD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02327&json=true","fetch_graph":"https://pith.science/api/pith-number/KMDIMBTDUVUG2WMZ3GMPLVKHON/graph.json","fetch_events":"https://pith.science/api/pith-number/KMDIMBTDUVUG2WMZ3GMPLVKHON/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KMDIMBTDUVUG2WMZ3GMPLVKHON/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KMDIMBTDUVUG2WMZ3GMPLVKHON/action/storage_attestation","attest_author":"https://pith.science/pith/KMDIMBTDUVUG2WMZ3GMPLVKHON/action/author_attestation","sign_citation":"https://pith.science/pith/KMDIMBTDUVUG2WMZ3GMPLVKHON/action/citation_signature","submit_replication":"https://pith.science/pith/KMDIMBTDUVUG2WMZ3GMPLVKHON/action/replication_record"}},"created_at":"2026-05-18T02:27:42.859925+00:00","updated_at":"2026-05-18T02:27:42.859925+00:00"}