{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3G673RMMLHPXFH4BKZGYFIQ6HF","short_pith_number":"pith:3G673RMM","schema_version":"1.0","canonical_sha256":"d9bdfdc58c59df729f81564d82a21e395fdc982e061106f24486d67ccc98f633","source":{"kind":"arxiv","id":"1702.02369","version":1},"attestation_state":"computed","paper":{"title":"Refining Trace Abstraction using Abstract Interpretation","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andreas Podelski, Daniel Dietsch, Marius Greitschus","submitted_at":"2017-02-08T11:04:12Z","abstract_excerpt":"The CEGAR loop in software model checking notoriously diverges when the abstraction refinement procedure does not derive a loop invariant. An abstraction refinement procedure based on an SMT solver is applied to a trace, i.e., a restricted form of a program (without loops). In this paper, we present a new abstraction refinement procedure that aims at circumventing this restriction whenever possible. We apply abstract interpretation to a program that we derive from the given trace. If the program contains a loop, we are guaranteed to obtain a loop invariant. We call an SMT solver only in the ca"},"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":"1702.02369","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2017-02-08T11:04:12Z","cross_cats_sorted":[],"title_canon_sha256":"9d977591f7d849ab7522fb06d08a7381b0bb71e9c31916b01f1bc81d7701b752","abstract_canon_sha256":"5598fb7c0dc55c1aec33efe70a39dd3d239b5f1d95a23b919689cb4abdf9ad3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:06.115957Z","signature_b64":"5wXRgq5iMURFK7wC3AiKVHSdVPz2M+SFl5H3IGDwRJSz1n+0+djsv33FF8Jq5ncWPcC3KE0NH/Ak54XS0wtKAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9bdfdc58c59df729f81564d82a21e395fdc982e061106f24486d67ccc98f633","last_reissued_at":"2026-05-18T00:51:06.115513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:06.115513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Refining Trace Abstraction using Abstract Interpretation","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andreas Podelski, Daniel Dietsch, Marius Greitschus","submitted_at":"2017-02-08T11:04:12Z","abstract_excerpt":"The CEGAR loop in software model checking notoriously diverges when the abstraction refinement procedure does not derive a loop invariant. An abstraction refinement procedure based on an SMT solver is applied to a trace, i.e., a restricted form of a program (without loops). In this paper, we present a new abstraction refinement procedure that aims at circumventing this restriction whenever possible. We apply abstract interpretation to a program that we derive from the given trace. If the program contains a loop, we are guaranteed to obtain a loop invariant. We call an SMT solver only in the ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02369","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":"1702.02369","created_at":"2026-05-18T00:51:06.115590+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02369v1","created_at":"2026-05-18T00:51:06.115590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02369","created_at":"2026-05-18T00:51:06.115590+00:00"},{"alias_kind":"pith_short_12","alias_value":"3G673RMMLHPX","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3G673RMMLHPXFH4B","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3G673RMM","created_at":"2026-05-18T12:30:58.224056+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/3G673RMMLHPXFH4BKZGYFIQ6HF","json":"https://pith.science/pith/3G673RMMLHPXFH4BKZGYFIQ6HF.json","graph_json":"https://pith.science/api/pith-number/3G673RMMLHPXFH4BKZGYFIQ6HF/graph.json","events_json":"https://pith.science/api/pith-number/3G673RMMLHPXFH4BKZGYFIQ6HF/events.json","paper":"https://pith.science/paper/3G673RMM"},"agent_actions":{"view_html":"https://pith.science/pith/3G673RMMLHPXFH4BKZGYFIQ6HF","download_json":"https://pith.science/pith/3G673RMMLHPXFH4BKZGYFIQ6HF.json","view_paper":"https://pith.science/paper/3G673RMM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02369&json=true","fetch_graph":"https://pith.science/api/pith-number/3G673RMMLHPXFH4BKZGYFIQ6HF/graph.json","fetch_events":"https://pith.science/api/pith-number/3G673RMMLHPXFH4BKZGYFIQ6HF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3G673RMMLHPXFH4BKZGYFIQ6HF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3G673RMMLHPXFH4BKZGYFIQ6HF/action/storage_attestation","attest_author":"https://pith.science/pith/3G673RMMLHPXFH4BKZGYFIQ6HF/action/author_attestation","sign_citation":"https://pith.science/pith/3G673RMMLHPXFH4BKZGYFIQ6HF/action/citation_signature","submit_replication":"https://pith.science/pith/3G673RMMLHPXFH4BKZGYFIQ6HF/action/replication_record"}},"created_at":"2026-05-18T00:51:06.115590+00:00","updated_at":"2026-05-18T00:51:06.115590+00:00"}