{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XCWRAVUOLMTZUNO6TGOB6MPDFK","short_pith_number":"pith:XCWRAVUO","schema_version":"1.0","canonical_sha256":"b8ad10568e5b279a35de999c1f31e32aad9100c2d7e92b65f40d1332e788cba5","source":{"kind":"arxiv","id":"1707.02011","version":1},"attestation_state":"computed","paper":{"title":"Lifting CDCL to Template-based Abstract Domains for Program Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daniel Kroening, Leopold Haller, Peter Schrammel, Rajdeep Mukherjee, Tom Melham","submitted_at":"2017-07-07T00:57:00Z","abstract_excerpt":"The success of Conflict Driven Clause Learning (CDCL) for Boolean satisfiability has inspired adoption in other domains. We present a novel lifting of CDCL to program analysis called Abstract Conflict Driven Learning for Programs (ACDLP). ACDLP alternates between model search, which performs over-approximate deduction with constraint propagation, and conflict analysis, which performs under-approximate abduction with heuristic choice. We instantiate the model search and conflict analysis algorithms to an abstract domain of template polyhedra, strictly generalizing CDCL from the Boolean lattice "},"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":"1707.02011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-07-07T00:57:00Z","cross_cats_sorted":[],"title_canon_sha256":"0b3371f9aa642e333ddb0bc367b228ec16716971e654ad89834b5183223251dc","abstract_canon_sha256":"4e12c366254cac09076d33865be13ea95d1df8185558bc491829c63b678b3e01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:45.494382Z","signature_b64":"Gl6Z+BBhHYW7Z4JgN5Lt8OX5gRl0QPW6A2XbImOE/7LHitnEHmik0p54pPbwm6gCsqh22VgH40iT4WFrG4x5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8ad10568e5b279a35de999c1f31e32aad9100c2d7e92b65f40d1332e788cba5","last_reissued_at":"2026-05-18T00:40:45.493720Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:45.493720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lifting CDCL to Template-based Abstract Domains for Program Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daniel Kroening, Leopold Haller, Peter Schrammel, Rajdeep Mukherjee, Tom Melham","submitted_at":"2017-07-07T00:57:00Z","abstract_excerpt":"The success of Conflict Driven Clause Learning (CDCL) for Boolean satisfiability has inspired adoption in other domains. We present a novel lifting of CDCL to program analysis called Abstract Conflict Driven Learning for Programs (ACDLP). ACDLP alternates between model search, which performs over-approximate deduction with constraint propagation, and conflict analysis, which performs under-approximate abduction with heuristic choice. We instantiate the model search and conflict analysis algorithms to an abstract domain of template polyhedra, strictly generalizing CDCL from the Boolean lattice "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02011","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":"1707.02011","created_at":"2026-05-18T00:40:45.493813+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.02011v1","created_at":"2026-05-18T00:40:45.493813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02011","created_at":"2026-05-18T00:40:45.493813+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCWRAVUOLMTZ","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCWRAVUOLMTZUNO6","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCWRAVUO","created_at":"2026-05-18T12:31:53.515858+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/XCWRAVUOLMTZUNO6TGOB6MPDFK","json":"https://pith.science/pith/XCWRAVUOLMTZUNO6TGOB6MPDFK.json","graph_json":"https://pith.science/api/pith-number/XCWRAVUOLMTZUNO6TGOB6MPDFK/graph.json","events_json":"https://pith.science/api/pith-number/XCWRAVUOLMTZUNO6TGOB6MPDFK/events.json","paper":"https://pith.science/paper/XCWRAVUO"},"agent_actions":{"view_html":"https://pith.science/pith/XCWRAVUOLMTZUNO6TGOB6MPDFK","download_json":"https://pith.science/pith/XCWRAVUOLMTZUNO6TGOB6MPDFK.json","view_paper":"https://pith.science/paper/XCWRAVUO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.02011&json=true","fetch_graph":"https://pith.science/api/pith-number/XCWRAVUOLMTZUNO6TGOB6MPDFK/graph.json","fetch_events":"https://pith.science/api/pith-number/XCWRAVUOLMTZUNO6TGOB6MPDFK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCWRAVUOLMTZUNO6TGOB6MPDFK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCWRAVUOLMTZUNO6TGOB6MPDFK/action/storage_attestation","attest_author":"https://pith.science/pith/XCWRAVUOLMTZUNO6TGOB6MPDFK/action/author_attestation","sign_citation":"https://pith.science/pith/XCWRAVUOLMTZUNO6TGOB6MPDFK/action/citation_signature","submit_replication":"https://pith.science/pith/XCWRAVUOLMTZUNO6TGOB6MPDFK/action/replication_record"}},"created_at":"2026-05-18T00:40:45.493813+00:00","updated_at":"2026-05-18T00:40:45.493813+00:00"}