{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:5JCURLSNH5TJ7FS73B27UIMG6H","short_pith_number":"pith:5JCURLSN","schema_version":"1.0","canonical_sha256":"ea4548ae4d3f669f965fd875fa2186f1d30c44a9279d1521adde454c1cc9e8f2","source":{"kind":"arxiv","id":"cs/0612003","version":2},"attestation_state":"computed","paper":{"title":"Predicate Abstraction via Symbolic Decision Procedures","license":"","headline":"","cross_cats":["cs.PL","cs.SC"],"primary_cat":"cs.LO","authors_text":"Byron Cook, Shuvendu K. Lahiri, Thomas Ball","submitted_at":"2006-12-01T19:56:11Z","abstract_excerpt":"We present a new approach for performing predicate abstraction based on symbolic decision procedures. Intuitively, a symbolic decision procedure for a theory takes a set of predicates in the theory and symbolically executes a decision procedure on all the subsets over the set of predicates. The result of the symbolic decision procedure is a shared expression (represented by a directed acyclic graph) that implicitly represents the answer to a predicate abstraction query.\n  We present symbolic decision procedures for the logic of Equality and Uninterpreted Functions (EUF) and Difference logic (D"},"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":"cs/0612003","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2006-12-01T19:56:11Z","cross_cats_sorted":["cs.PL","cs.SC"],"title_canon_sha256":"e6465c6a0ff89e91fb62db2572f46b061510a9ccc14b05836daae3533bf0252c","abstract_canon_sha256":"33a531b958c98a1288fb73d5cebb2bf9429941c81e460b6e6aebd628434da344"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:03.270520Z","signature_b64":"TotqROldgNqFLlp6dUy/uvEjqDz3iwvp1L9I7ePfl0ex8eVL0SwuSgBTDhv4rHQf9uDCTXml4xBBJZLs2y8WBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea4548ae4d3f669f965fd875fa2186f1d30c44a9279d1521adde454c1cc9e8f2","last_reissued_at":"2026-05-18T00:53:03.269942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:03.269942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Predicate Abstraction via Symbolic Decision Procedures","license":"","headline":"","cross_cats":["cs.PL","cs.SC"],"primary_cat":"cs.LO","authors_text":"Byron Cook, Shuvendu K. Lahiri, Thomas Ball","submitted_at":"2006-12-01T19:56:11Z","abstract_excerpt":"We present a new approach for performing predicate abstraction based on symbolic decision procedures. Intuitively, a symbolic decision procedure for a theory takes a set of predicates in the theory and symbolically executes a decision procedure on all the subsets over the set of predicates. The result of the symbolic decision procedure is a shared expression (represented by a directed acyclic graph) that implicitly represents the answer to a predicate abstraction query.\n  We present symbolic decision procedures for the logic of Equality and Uninterpreted Functions (EUF) and Difference logic (D"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0612003","kind":"arxiv","version":2},"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":"cs/0612003","created_at":"2026-05-18T00:53:03.270014+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0612003v2","created_at":"2026-05-18T00:53:03.270014+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0612003","created_at":"2026-05-18T00:53:03.270014+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JCURLSNH5TJ","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JCURLSNH5TJ7FS7","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JCURLSN","created_at":"2026-05-18T12:25:53.939244+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/5JCURLSNH5TJ7FS73B27UIMG6H","json":"https://pith.science/pith/5JCURLSNH5TJ7FS73B27UIMG6H.json","graph_json":"https://pith.science/api/pith-number/5JCURLSNH5TJ7FS73B27UIMG6H/graph.json","events_json":"https://pith.science/api/pith-number/5JCURLSNH5TJ7FS73B27UIMG6H/events.json","paper":"https://pith.science/paper/5JCURLSN"},"agent_actions":{"view_html":"https://pith.science/pith/5JCURLSNH5TJ7FS73B27UIMG6H","download_json":"https://pith.science/pith/5JCURLSNH5TJ7FS73B27UIMG6H.json","view_paper":"https://pith.science/paper/5JCURLSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0612003&json=true","fetch_graph":"https://pith.science/api/pith-number/5JCURLSNH5TJ7FS73B27UIMG6H/graph.json","fetch_events":"https://pith.science/api/pith-number/5JCURLSNH5TJ7FS73B27UIMG6H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JCURLSNH5TJ7FS73B27UIMG6H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JCURLSNH5TJ7FS73B27UIMG6H/action/storage_attestation","attest_author":"https://pith.science/pith/5JCURLSNH5TJ7FS73B27UIMG6H/action/author_attestation","sign_citation":"https://pith.science/pith/5JCURLSNH5TJ7FS73B27UIMG6H/action/citation_signature","submit_replication":"https://pith.science/pith/5JCURLSNH5TJ7FS73B27UIMG6H/action/replication_record"}},"created_at":"2026-05-18T00:53:03.270014+00:00","updated_at":"2026-05-18T00:53:03.270014+00:00"}