{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:K3TO4CLINPEIDKIZ7K6REF2RXM","short_pith_number":"pith:K3TO4CLI","schema_version":"1.0","canonical_sha256":"56e6ee09686bc881a919fabd121751bb2ab49730a60bd98406ef99fb5f62d1c6","source":{"kind":"arxiv","id":"1607.04456","version":1},"attestation_state":"computed","paper":{"title":"Efficient CTL Verification via Horn Constraints Solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andrey Rybalchenko (Microsoft Research, Cambridge, Corneliu Popeea (CQSE GmbH, Germany), Munich, Tewodros A. Beyene (fortiss GmbH, UK)","submitted_at":"2016-07-15T11:04:37Z","abstract_excerpt":"The use of temporal logics has long been recognised as a fundamental approach to the formal specification and verification of reactive systems. In this paper, we take on the problem of automatically verifying a temporal property, given by a CTL formula, for a given (possibly infinite-state) program. We propose a method based on encoding the problem as a set of Horn constraints. The method takes a program, modeled as a transition system, and a property given by a CTL formula as input. It first generates a set of forall-exists quantified Horn constraints and well-foundedness constraints by explo"},"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":"1607.04456","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-07-15T11:04:37Z","cross_cats_sorted":[],"title_canon_sha256":"b8507904c8684dffba8def71a1b7cb1594ebae49c41a117af4949225b78e4a40","abstract_canon_sha256":"54a701054a739a0de4435c2554aeaf80f461e3c358d5436bb94d630bf69edb32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:01.184976Z","signature_b64":"CbWJ5W/UkTrNcCxwFvcFnAod9WzJ2PTMbYZmUPBFMDHBruRYw3o4Ohvlualgq1upoqJc2bis/XbT5qKUvxHqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56e6ee09686bc881a919fabd121751bb2ab49730a60bd98406ef99fb5f62d1c6","last_reissued_at":"2026-05-18T01:11:01.184481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:01.184481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient CTL Verification via Horn Constraints Solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andrey Rybalchenko (Microsoft Research, Cambridge, Corneliu Popeea (CQSE GmbH, Germany), Munich, Tewodros A. Beyene (fortiss GmbH, UK)","submitted_at":"2016-07-15T11:04:37Z","abstract_excerpt":"The use of temporal logics has long been recognised as a fundamental approach to the formal specification and verification of reactive systems. In this paper, we take on the problem of automatically verifying a temporal property, given by a CTL formula, for a given (possibly infinite-state) program. We propose a method based on encoding the problem as a set of Horn constraints. The method takes a program, modeled as a transition system, and a property given by a CTL formula as input. It first generates a set of forall-exists quantified Horn constraints and well-foundedness constraints by explo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04456","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":"1607.04456","created_at":"2026-05-18T01:11:01.184549+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.04456v1","created_at":"2026-05-18T01:11:01.184549+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04456","created_at":"2026-05-18T01:11:01.184549+00:00"},{"alias_kind":"pith_short_12","alias_value":"K3TO4CLINPEI","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"K3TO4CLINPEIDKIZ","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"K3TO4CLI","created_at":"2026-05-18T12:30:25.849896+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/K3TO4CLINPEIDKIZ7K6REF2RXM","json":"https://pith.science/pith/K3TO4CLINPEIDKIZ7K6REF2RXM.json","graph_json":"https://pith.science/api/pith-number/K3TO4CLINPEIDKIZ7K6REF2RXM/graph.json","events_json":"https://pith.science/api/pith-number/K3TO4CLINPEIDKIZ7K6REF2RXM/events.json","paper":"https://pith.science/paper/K3TO4CLI"},"agent_actions":{"view_html":"https://pith.science/pith/K3TO4CLINPEIDKIZ7K6REF2RXM","download_json":"https://pith.science/pith/K3TO4CLINPEIDKIZ7K6REF2RXM.json","view_paper":"https://pith.science/paper/K3TO4CLI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.04456&json=true","fetch_graph":"https://pith.science/api/pith-number/K3TO4CLINPEIDKIZ7K6REF2RXM/graph.json","fetch_events":"https://pith.science/api/pith-number/K3TO4CLINPEIDKIZ7K6REF2RXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K3TO4CLINPEIDKIZ7K6REF2RXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K3TO4CLINPEIDKIZ7K6REF2RXM/action/storage_attestation","attest_author":"https://pith.science/pith/K3TO4CLINPEIDKIZ7K6REF2RXM/action/author_attestation","sign_citation":"https://pith.science/pith/K3TO4CLINPEIDKIZ7K6REF2RXM/action/citation_signature","submit_replication":"https://pith.science/pith/K3TO4CLINPEIDKIZ7K6REF2RXM/action/replication_record"}},"created_at":"2026-05-18T01:11:01.184549+00:00","updated_at":"2026-05-18T01:11:01.184549+00:00"}