{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WKGBINPXQ2EKHNE4EXJJ6CARC6","short_pith_number":"pith:WKGBINPX","schema_version":"1.0","canonical_sha256":"b28c1435f78688a3b49c25d29f081117a75fb4ebecaa7b4dfbae6ce1e7544d45","source":{"kind":"arxiv","id":"1509.02471","version":1},"attestation_state":"computed","paper":{"title":"Model Checking Embedded C Software using k-Induction and Invariants (extended version)","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-09-08T17:54:27Z","abstract_excerpt":"We present a proof by induction algorithm, which combines k-induction with invariants to model check embedded C software 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-induc"},"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":"1509.02471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-09-08T17:54:27Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"3144658fa5875e15496bb437ba63a1731ea09ec669200a769cf9653fa865b6b1","abstract_canon_sha256":"5df7ac72f84dec17f71888317d8cf27ee4fa68b483dbfe170e896f0195b8462a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:40.830145Z","signature_b64":"0oSO4tO7QEYiEJ34DK1XWZJ3QkedCZHCSl7R6wAwFPzIQFbSKlWMGRhDT23MVXyv+tWINTeQFHDY9Lnc4AvKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b28c1435f78688a3b49c25d29f081117a75fb4ebecaa7b4dfbae6ce1e7544d45","last_reissued_at":"2026-05-18T01:33:40.829595Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:40.829595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model Checking Embedded C Software using k-Induction and Invariants (extended version)","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-09-08T17:54:27Z","abstract_excerpt":"We present a proof by induction algorithm, which combines k-induction with invariants to model check embedded C software 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-induc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02471","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":"1509.02471","created_at":"2026-05-18T01:33:40.829693+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.02471v1","created_at":"2026-05-18T01:33:40.829693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02471","created_at":"2026-05-18T01:33:40.829693+00:00"},{"alias_kind":"pith_short_12","alias_value":"WKGBINPXQ2EK","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WKGBINPXQ2EKHNE4","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WKGBINPX","created_at":"2026-05-18T12:29:47.479230+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/WKGBINPXQ2EKHNE4EXJJ6CARC6","json":"https://pith.science/pith/WKGBINPXQ2EKHNE4EXJJ6CARC6.json","graph_json":"https://pith.science/api/pith-number/WKGBINPXQ2EKHNE4EXJJ6CARC6/graph.json","events_json":"https://pith.science/api/pith-number/WKGBINPXQ2EKHNE4EXJJ6CARC6/events.json","paper":"https://pith.science/paper/WKGBINPX"},"agent_actions":{"view_html":"https://pith.science/pith/WKGBINPXQ2EKHNE4EXJJ6CARC6","download_json":"https://pith.science/pith/WKGBINPXQ2EKHNE4EXJJ6CARC6.json","view_paper":"https://pith.science/paper/WKGBINPX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.02471&json=true","fetch_graph":"https://pith.science/api/pith-number/WKGBINPXQ2EKHNE4EXJJ6CARC6/graph.json","fetch_events":"https://pith.science/api/pith-number/WKGBINPXQ2EKHNE4EXJJ6CARC6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WKGBINPXQ2EKHNE4EXJJ6CARC6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WKGBINPXQ2EKHNE4EXJJ6CARC6/action/storage_attestation","attest_author":"https://pith.science/pith/WKGBINPXQ2EKHNE4EXJJ6CARC6/action/author_attestation","sign_citation":"https://pith.science/pith/WKGBINPXQ2EKHNE4EXJJ6CARC6/action/citation_signature","submit_replication":"https://pith.science/pith/WKGBINPXQ2EKHNE4EXJJ6CARC6/action/replication_record"}},"created_at":"2026-05-18T01:33:40.829693+00:00","updated_at":"2026-05-18T01:33:40.829693+00:00"}