{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:24SLBTI5FAIQPG35WVT25DDS2V","short_pith_number":"pith:24SLBTI5","schema_version":"1.0","canonical_sha256":"d724b0cd1d2811079b7db567ae8c72d559f41a36bf9846e22510ea7a52e7ea9e","source":{"kind":"arxiv","id":"1708.01473","version":2},"attestation_state":"computed","paper":{"title":"Predicate Pairing for Program Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.LO","authors_text":"(2) DICII, (3) CNR-IASI, Alberto Pettorossi (2), Emanuele De Angelis (1), Fabio Fioravanti (1), Italy, Italy), Maurizio Proietti (3) ((1) DEC, Pescara, Roma, Universita' di Roma Tor Vergata, University G. d'Annunzio","submitted_at":"2017-08-04T12:24:22Z","abstract_excerpt":"It is well-known that the verification of partial correctness properties of imperative programs can be reduced to the satisfiability problem for constrained Horn clauses (CHCs). However, state-of-the-art solvers for CHCs (CHC solvers) based on predicate abstraction are sometimes unable to verify satisfiability because they look for models that are definable in a given class A of constraints, called A-definable models. We introduce a transformation technique, called Predicate Pairing (PP), which is able, in many interesting cases, to transform a set of clauses into an equisatisfiable set whose "},"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":"1708.01473","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-08-04T12:24:22Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"d45d1fe23fa95318fc8dfd7b373893196a725fe7f8d67198f3a8f3a8fe03b0ad","abstract_canon_sha256":"cc54253db3fe583807d1beabf45a9833f988dc64a7be11824b08709ffab3089c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:11.256408Z","signature_b64":"rOUQSfnVTWxEJRA/1NTzqbgjRsjH6+ZtyTublCb+7OOG5SQLe6LIy9vyin+Sf4esBSPqBEJx71G00Ia5kLBkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d724b0cd1d2811079b7db567ae8c72d559f41a36bf9846e22510ea7a52e7ea9e","last_reissued_at":"2026-05-18T00:12:11.255923Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:11.255923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Predicate Pairing for Program Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.LO","authors_text":"(2) DICII, (3) CNR-IASI, Alberto Pettorossi (2), Emanuele De Angelis (1), Fabio Fioravanti (1), Italy, Italy), Maurizio Proietti (3) ((1) DEC, Pescara, Roma, Universita' di Roma Tor Vergata, University G. d'Annunzio","submitted_at":"2017-08-04T12:24:22Z","abstract_excerpt":"It is well-known that the verification of partial correctness properties of imperative programs can be reduced to the satisfiability problem for constrained Horn clauses (CHCs). However, state-of-the-art solvers for CHCs (CHC solvers) based on predicate abstraction are sometimes unable to verify satisfiability because they look for models that are definable in a given class A of constraints, called A-definable models. We introduce a transformation technique, called Predicate Pairing (PP), which is able, in many interesting cases, to transform a set of clauses into an equisatisfiable set whose "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01473","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":"1708.01473","created_at":"2026-05-18T00:12:11.255996+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.01473v2","created_at":"2026-05-18T00:12:11.255996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01473","created_at":"2026-05-18T00:12:11.255996+00:00"},{"alias_kind":"pith_short_12","alias_value":"24SLBTI5FAIQ","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"24SLBTI5FAIQPG35","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"24SLBTI5","created_at":"2026-05-18T12:30:55.937587+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/24SLBTI5FAIQPG35WVT25DDS2V","json":"https://pith.science/pith/24SLBTI5FAIQPG35WVT25DDS2V.json","graph_json":"https://pith.science/api/pith-number/24SLBTI5FAIQPG35WVT25DDS2V/graph.json","events_json":"https://pith.science/api/pith-number/24SLBTI5FAIQPG35WVT25DDS2V/events.json","paper":"https://pith.science/paper/24SLBTI5"},"agent_actions":{"view_html":"https://pith.science/pith/24SLBTI5FAIQPG35WVT25DDS2V","download_json":"https://pith.science/pith/24SLBTI5FAIQPG35WVT25DDS2V.json","view_paper":"https://pith.science/paper/24SLBTI5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.01473&json=true","fetch_graph":"https://pith.science/api/pith-number/24SLBTI5FAIQPG35WVT25DDS2V/graph.json","fetch_events":"https://pith.science/api/pith-number/24SLBTI5FAIQPG35WVT25DDS2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/24SLBTI5FAIQPG35WVT25DDS2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/24SLBTI5FAIQPG35WVT25DDS2V/action/storage_attestation","attest_author":"https://pith.science/pith/24SLBTI5FAIQPG35WVT25DDS2V/action/author_attestation","sign_citation":"https://pith.science/pith/24SLBTI5FAIQPG35WVT25DDS2V/action/citation_signature","submit_replication":"https://pith.science/pith/24SLBTI5FAIQPG35WVT25DDS2V/action/replication_record"}},"created_at":"2026-05-18T00:12:11.255996+00:00","updated_at":"2026-05-18T00:12:11.255996+00:00"}