{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6BFYP32W32SBZDXLHND252AQ32","short_pith_number":"pith:6BFYP32W","canonical_record":{"source":{"id":"1711.07257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-11-20T11:14:24Z","cross_cats_sorted":[],"title_canon_sha256":"15cf1d1146dfe6dc9dc79041111a3052653214abfbbcc9ece1cf9d14e145b7ae","abstract_canon_sha256":"dea0a7386cb131c7008f5efd2a8a00191232453bcd3a6dcffefa658e72c4d769"},"schema_version":"1.0"},"canonical_sha256":"f04b87ef56dea41c8eeb3b47aee810dea54b650a11eb24965fffc76098e07620","source":{"kind":"arxiv","id":"1711.07257","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07257","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07257v1","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07257","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"pith_short_12","alias_value":"6BFYP32W32SB","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6BFYP32W32SBZDXL","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6BFYP32W","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6BFYP32W32SBZDXLHND252AQ32","target":"record","payload":{"canonical_record":{"source":{"id":"1711.07257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-11-20T11:14:24Z","cross_cats_sorted":[],"title_canon_sha256":"15cf1d1146dfe6dc9dc79041111a3052653214abfbbcc9ece1cf9d14e145b7ae","abstract_canon_sha256":"dea0a7386cb131c7008f5efd2a8a00191232453bcd3a6dcffefa658e72c4d769"},"schema_version":"1.0"},"canonical_sha256":"f04b87ef56dea41c8eeb3b47aee810dea54b650a11eb24965fffc76098e07620","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:10.717196Z","signature_b64":"B4/acSfc3M7gB5p33FclgxhFAHvJwHNoVQFZdgHa4P1yZEYAcLGEUC+Ym1DtmmrrVtMTPPmIod8xVJBj5gcBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f04b87ef56dea41c8eeb3b47aee810dea54b650a11eb24965fffc76098e07620","last_reissued_at":"2026-05-18T00:30:10.716481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:10.716481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.07257","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:30:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+0SkXR6Py/q2L6ER87dhao18jt46dNt7Q07GiBdSitCA7HpQJTZU+ObuOXe8VLyBxf8uYRO1iJrgr44kFVoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:04:49.847524Z"},"content_sha256":"b0f11f543b009109e42b18942946fc1baceb611b64883ef318664f60d0f84199","schema_version":"1.0","event_id":"sha256:b0f11f543b009109e42b18942946fc1baceb611b64883ef318664f60d0f84199"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6BFYP32W32SBZDXLHND252AQ32","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Abstract Interpretation of Binary Code with Memory Accesses using Polyhedra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Cl\\'ement Ballabriga, Giuseppe Lipari, Julien Forget","submitted_at":"2017-11-20T11:14:24Z","abstract_excerpt":"In this paper we propose a novel methodology for static analysis of binary code using abstract interpretation. We use an abstract domain based on polyhedra and two mapping functions that associate polyhedra variables with registers and memory. We demonstrate our methodology to the problem of computing upper bounds to loop iterations in the code. This problem is particularly important in the domain of Worst-Case Execution Time (WCET) analysis of safety-critical real-time code. However, our approach is general and it can applied to other static analysis problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07257","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:30:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/YlRW3gy+D1sf47OL5Nv848gzxWCqwdvZnM92oF+SJl0PTVUeucb4qHSWfFfNE8z+KnCPqu7MbAKNKTuGobXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:04:49.847869Z"},"content_sha256":"add42ef41ad4ea555e8798759f3a7599471f5cdf645aa1a75053b86f7fdb4d5d","schema_version":"1.0","event_id":"sha256:add42ef41ad4ea555e8798759f3a7599471f5cdf645aa1a75053b86f7fdb4d5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6BFYP32W32SBZDXLHND252AQ32/bundle.json","state_url":"https://pith.science/pith/6BFYP32W32SBZDXLHND252AQ32/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6BFYP32W32SBZDXLHND252AQ32/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T19:04:49Z","links":{"resolver":"https://pith.science/pith/6BFYP32W32SBZDXLHND252AQ32","bundle":"https://pith.science/pith/6BFYP32W32SBZDXLHND252AQ32/bundle.json","state":"https://pith.science/pith/6BFYP32W32SBZDXLHND252AQ32/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6BFYP32W32SBZDXLHND252AQ32/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6BFYP32W32SBZDXLHND252AQ32","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"dea0a7386cb131c7008f5efd2a8a00191232453bcd3a6dcffefa658e72c4d769","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-11-20T11:14:24Z","title_canon_sha256":"15cf1d1146dfe6dc9dc79041111a3052653214abfbbcc9ece1cf9d14e145b7ae"},"schema_version":"1.0","source":{"id":"1711.07257","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07257","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07257v1","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07257","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"pith_short_12","alias_value":"6BFYP32W32SB","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6BFYP32W32SBZDXL","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6BFYP32W","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:add42ef41ad4ea555e8798759f3a7599471f5cdf645aa1a75053b86f7fdb4d5d","target":"graph","created_at":"2026-05-18T00:30:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper we propose a novel methodology for static analysis of binary code using abstract interpretation. We use an abstract domain based on polyhedra and two mapping functions that associate polyhedra variables with registers and memory. We demonstrate our methodology to the problem of computing upper bounds to loop iterations in the code. This problem is particularly important in the domain of Worst-Case Execution Time (WCET) analysis of safety-critical real-time code. However, our approach is general and it can applied to other static analysis problems.","authors_text":"Cl\\'ement Ballabriga, Giuseppe Lipari, Julien Forget","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-11-20T11:14:24Z","title":"Abstract Interpretation of Binary Code with Memory Accesses using Polyhedra"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07257","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b0f11f543b009109e42b18942946fc1baceb611b64883ef318664f60d0f84199","target":"record","created_at":"2026-05-18T00:30:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"dea0a7386cb131c7008f5efd2a8a00191232453bcd3a6dcffefa658e72c4d769","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-11-20T11:14:24Z","title_canon_sha256":"15cf1d1146dfe6dc9dc79041111a3052653214abfbbcc9ece1cf9d14e145b7ae"},"schema_version":"1.0","source":{"id":"1711.07257","kind":"arxiv","version":1}},"canonical_sha256":"f04b87ef56dea41c8eeb3b47aee810dea54b650a11eb24965fffc76098e07620","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f04b87ef56dea41c8eeb3b47aee810dea54b650a11eb24965fffc76098e07620","first_computed_at":"2026-05-18T00:30:10.716481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:10.716481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B4/acSfc3M7gB5p33FclgxhFAHvJwHNoVQFZdgHa4P1yZEYAcLGEUC+Ym1DtmmrrVtMTPPmIod8xVJBj5gcBCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:10.717196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07257","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0f11f543b009109e42b18942946fc1baceb611b64883ef318664f60d0f84199","sha256:add42ef41ad4ea555e8798759f3a7599471f5cdf645aa1a75053b86f7fdb4d5d"],"state_sha256":"c9486145ab46f84029fb734f26777eceb7b9e98d50492c5f1fbf33711cce6de1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2J0xN13LM1vpxTnSNU9S7ndCuGWo7cgCDoLpaqWc4FABPwuFBvgssIxCRbEY2620DCXfezVOjpD5/pT9CwbiDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T19:04:49.849774Z","bundle_sha256":"44c8a2c3c00bc96a12940e629ac9724ebd192615438d9aac26fb8ff376afcb2b"}}