{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EUY5555TU5MC4FM4ZIGB2FGTK5","short_pith_number":"pith:EUY5555T","schema_version":"1.0","canonical_sha256":"2531def7b3a7582e159cca0c1d14d3574f88e9e653c4ae980b3d157165ba0ad5","source":{"kind":"arxiv","id":"1505.04581","version":1},"attestation_state":"computed","paper":{"title":"Synthesising Interprocedural Bit-Precise Termination Proofs (extended version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.SE","authors_text":"Bj\\\"orn Wachter, Cristina David, Daniel Kroening, Hong-Yi Chen, Peter Schrammel","submitted_at":"2015-05-18T10:18:45Z","abstract_excerpt":"Proving program termination is key to guaranteeing absence of undesirable behaviour, such as hanging programs and even security vulnerabilities such as denial-of-service attacks. To make termination checks scale to large systems, interprocedural termination analysis seems essential, which is a largely unexplored area of research in termination analysis, where most effort has focussed on difficult single-procedure problems. We present a modular termination analysis for C programs using template-based interprocedural summarisation. Our analysis combines a context-sensitive, over-approximating fo"},"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":"1505.04581","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2015-05-18T10:18:45Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"0a0418b8915606784d44cfb7fa6e04cc781319455a01a19c123fca588ebf70a1","abstract_canon_sha256":"7410ef650f2adbfa6715d1a61266b99315b45b4e7d87e6e67fa433862bfe7e5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:25.106362Z","signature_b64":"BX7bFWs3mDpbL9g6zCE4hXTY33EhuQE3ask74JO8FGIoD/AIjCrhGyYMgnR7fM/t7fDNthKaJJbX3GNslXOdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2531def7b3a7582e159cca0c1d14d3574f88e9e653c4ae980b3d157165ba0ad5","last_reissued_at":"2026-05-18T02:07:25.105859Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:25.105859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synthesising Interprocedural Bit-Precise Termination Proofs (extended version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.SE","authors_text":"Bj\\\"orn Wachter, Cristina David, Daniel Kroening, Hong-Yi Chen, Peter Schrammel","submitted_at":"2015-05-18T10:18:45Z","abstract_excerpt":"Proving program termination is key to guaranteeing absence of undesirable behaviour, such as hanging programs and even security vulnerabilities such as denial-of-service attacks. To make termination checks scale to large systems, interprocedural termination analysis seems essential, which is a largely unexplored area of research in termination analysis, where most effort has focussed on difficult single-procedure problems. We present a modular termination analysis for C programs using template-based interprocedural summarisation. Our analysis combines a context-sensitive, over-approximating fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04581","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":"1505.04581","created_at":"2026-05-18T02:07:25.105953+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04581v1","created_at":"2026-05-18T02:07:25.105953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04581","created_at":"2026-05-18T02:07:25.105953+00:00"},{"alias_kind":"pith_short_12","alias_value":"EUY5555TU5MC","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EUY5555TU5MC4FM4","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EUY5555T","created_at":"2026-05-18T12:29:19.899920+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/EUY5555TU5MC4FM4ZIGB2FGTK5","json":"https://pith.science/pith/EUY5555TU5MC4FM4ZIGB2FGTK5.json","graph_json":"https://pith.science/api/pith-number/EUY5555TU5MC4FM4ZIGB2FGTK5/graph.json","events_json":"https://pith.science/api/pith-number/EUY5555TU5MC4FM4ZIGB2FGTK5/events.json","paper":"https://pith.science/paper/EUY5555T"},"agent_actions":{"view_html":"https://pith.science/pith/EUY5555TU5MC4FM4ZIGB2FGTK5","download_json":"https://pith.science/pith/EUY5555TU5MC4FM4ZIGB2FGTK5.json","view_paper":"https://pith.science/paper/EUY5555T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04581&json=true","fetch_graph":"https://pith.science/api/pith-number/EUY5555TU5MC4FM4ZIGB2FGTK5/graph.json","fetch_events":"https://pith.science/api/pith-number/EUY5555TU5MC4FM4ZIGB2FGTK5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EUY5555TU5MC4FM4ZIGB2FGTK5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EUY5555TU5MC4FM4ZIGB2FGTK5/action/storage_attestation","attest_author":"https://pith.science/pith/EUY5555TU5MC4FM4ZIGB2FGTK5/action/author_attestation","sign_citation":"https://pith.science/pith/EUY5555TU5MC4FM4ZIGB2FGTK5/action/citation_signature","submit_replication":"https://pith.science/pith/EUY5555TU5MC4FM4ZIGB2FGTK5/action/replication_record"}},"created_at":"2026-05-18T02:07:25.105953+00:00","updated_at":"2026-05-18T02:07:25.105953+00:00"}