{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:Y6O3P33UYHRZITJFRSK5K577RS","short_pith_number":"pith:Y6O3P33U","schema_version":"1.0","canonical_sha256":"c79db7ef74c1e3944d258c95d577ff8c829767037a209fc22b99d5b3183679a4","source":{"kind":"arxiv","id":"2107.12902","version":1},"attestation_state":"computed","paper":{"title":"Logical Characterization of Coherent Uninterpreted Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Arie Gurfinkel, Hari Govind V K, Sharon Shoham","submitted_at":"2021-07-26T03:52:56Z","abstract_excerpt":"An uninterpreted program (UP) is a program whose semantics is defined over the theory of uninterpreted functions. This is a common abstraction used in equivalence checking, compiler optimization, and program verification. While simple, the model is sufficiently powerful to encode counter automata, and, hence, undecidable. Recently, a class of UP programs, called coherent, has been proposed and shown to be decidable. We provide an alternative, logical characterization, of this result. Specifically, we show that every coherent program is bisimilar to a finite state system. Moreover, an inductive"},"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":"2107.12902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2021-07-26T03:52:56Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"31e9153e4fbc911c25421a7130f4ce6d657219f563523b94a6b74471cbff2315","abstract_canon_sha256":"30894bbaf51f41e2d60ae939510f40a9cbafe6119ab7518b5508468165afc0ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:01:01.732761Z","signature_b64":"wxnutYDRyOZ8+VEYnT5hvc3i8vqBego+S+BsHK3DPsinE0Ak1qCfTJSaXRPQ/48mG3qQoSn+O3lPQ3KtsCNODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c79db7ef74c1e3944d258c95d577ff8c829767037a209fc22b99d5b3183679a4","last_reissued_at":"2026-07-05T03:01:01.732278Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:01:01.732278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logical Characterization of Coherent Uninterpreted Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Arie Gurfinkel, Hari Govind V K, Sharon Shoham","submitted_at":"2021-07-26T03:52:56Z","abstract_excerpt":"An uninterpreted program (UP) is a program whose semantics is defined over the theory of uninterpreted functions. This is a common abstraction used in equivalence checking, compiler optimization, and program verification. While simple, the model is sufficiently powerful to encode counter automata, and, hence, undecidable. Recently, a class of UP programs, called coherent, has been proposed and shown to be decidable. We provide an alternative, logical characterization, of this result. Specifically, we show that every coherent program is bisimilar to a finite state system. Moreover, an inductive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.12902","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.12902/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2107.12902","created_at":"2026-07-05T03:01:01.732367+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.12902v1","created_at":"2026-07-05T03:01:01.732367+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.12902","created_at":"2026-07-05T03:01:01.732367+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y6O3P33UYHRZ","created_at":"2026-07-05T03:01:01.732367+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y6O3P33UYHRZITJF","created_at":"2026-07-05T03:01:01.732367+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y6O3P33U","created_at":"2026-07-05T03:01:01.732367+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/Y6O3P33UYHRZITJFRSK5K577RS","json":"https://pith.science/pith/Y6O3P33UYHRZITJFRSK5K577RS.json","graph_json":"https://pith.science/api/pith-number/Y6O3P33UYHRZITJFRSK5K577RS/graph.json","events_json":"https://pith.science/api/pith-number/Y6O3P33UYHRZITJFRSK5K577RS/events.json","paper":"https://pith.science/paper/Y6O3P33U"},"agent_actions":{"view_html":"https://pith.science/pith/Y6O3P33UYHRZITJFRSK5K577RS","download_json":"https://pith.science/pith/Y6O3P33UYHRZITJFRSK5K577RS.json","view_paper":"https://pith.science/paper/Y6O3P33U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.12902&json=true","fetch_graph":"https://pith.science/api/pith-number/Y6O3P33UYHRZITJFRSK5K577RS/graph.json","fetch_events":"https://pith.science/api/pith-number/Y6O3P33UYHRZITJFRSK5K577RS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y6O3P33UYHRZITJFRSK5K577RS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y6O3P33UYHRZITJFRSK5K577RS/action/storage_attestation","attest_author":"https://pith.science/pith/Y6O3P33UYHRZITJFRSK5K577RS/action/author_attestation","sign_citation":"https://pith.science/pith/Y6O3P33UYHRZITJFRSK5K577RS/action/citation_signature","submit_replication":"https://pith.science/pith/Y6O3P33UYHRZITJFRSK5K577RS/action/replication_record"}},"created_at":"2026-07-05T03:01:01.732367+00:00","updated_at":"2026-07-05T03:01:01.732367+00:00"}