{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DQ2GPPLCSPQBKZZZRSL6WH24LD","short_pith_number":"pith:DQ2GPPLC","schema_version":"1.0","canonical_sha256":"1c3467bd6293e01567398c97eb1f5c58c01474f8932bf93146cb557b38cb0bfa","source":{"kind":"arxiv","id":"1112.5000","version":1},"attestation_state":"computed","paper":{"title":"Lazy Pointer Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Alan Mycroft, Prashant Singh Rawat, Uday P. Khedker","submitted_at":"2011-12-21T12:01:37Z","abstract_excerpt":"Flow- and context-sensitive pointer analysis is generally considered too expensive for large programs; most tools relax one or both of the requirements for scalability. We formulate a flow- and context-sensitive points-to analysis that is lazy in the following sense: points-to information is computed only for live pointers and its propagation is sparse (restricted to live ranges of respective pointers). Further, our analysis (a) uses strong liveness, effectively including dead code elimination; (b) afterwards calculates must-points-to information from may-points-to information instead of using"},"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":"1112.5000","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2011-12-21T12:01:37Z","cross_cats_sorted":[],"title_canon_sha256":"cb0560e1dd96123a5817282ecadb80d907c4f4e1aff64181fbaebc2dfd3831ab","abstract_canon_sha256":"8901ef04f64b545e595545373cad42a07723ec5f1beb22804eb8c437fda84bba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:56.516803Z","signature_b64":"D+E0KUPEpoO5ncmJ/46A0Zwku57i7uJ37+d7hpFzlGaZWNYUo8g4OeghKgVPew7jUhG2awQPcZhdtA9Hx9jLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c3467bd6293e01567398c97eb1f5c58c01474f8932bf93146cb557b38cb0bfa","last_reissued_at":"2026-05-18T04:05:56.513150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:56.513150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lazy Pointer Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Alan Mycroft, Prashant Singh Rawat, Uday P. Khedker","submitted_at":"2011-12-21T12:01:37Z","abstract_excerpt":"Flow- and context-sensitive pointer analysis is generally considered too expensive for large programs; most tools relax one or both of the requirements for scalability. We formulate a flow- and context-sensitive points-to analysis that is lazy in the following sense: points-to information is computed only for live pointers and its propagation is sparse (restricted to live ranges of respective pointers). Further, our analysis (a) uses strong liveness, effectively including dead code elimination; (b) afterwards calculates must-points-to information from may-points-to information instead of using"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5000","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":"1112.5000","created_at":"2026-05-18T04:05:56.513231+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.5000v1","created_at":"2026-05-18T04:05:56.513231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5000","created_at":"2026-05-18T04:05:56.513231+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQ2GPPLCSPQB","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQ2GPPLCSPQBKZZZ","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQ2GPPLC","created_at":"2026-05-18T12:26:26.731475+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/DQ2GPPLCSPQBKZZZRSL6WH24LD","json":"https://pith.science/pith/DQ2GPPLCSPQBKZZZRSL6WH24LD.json","graph_json":"https://pith.science/api/pith-number/DQ2GPPLCSPQBKZZZRSL6WH24LD/graph.json","events_json":"https://pith.science/api/pith-number/DQ2GPPLCSPQBKZZZRSL6WH24LD/events.json","paper":"https://pith.science/paper/DQ2GPPLC"},"agent_actions":{"view_html":"https://pith.science/pith/DQ2GPPLCSPQBKZZZRSL6WH24LD","download_json":"https://pith.science/pith/DQ2GPPLCSPQBKZZZRSL6WH24LD.json","view_paper":"https://pith.science/paper/DQ2GPPLC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.5000&json=true","fetch_graph":"https://pith.science/api/pith-number/DQ2GPPLCSPQBKZZZRSL6WH24LD/graph.json","fetch_events":"https://pith.science/api/pith-number/DQ2GPPLCSPQBKZZZRSL6WH24LD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQ2GPPLCSPQBKZZZRSL6WH24LD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQ2GPPLCSPQBKZZZRSL6WH24LD/action/storage_attestation","attest_author":"https://pith.science/pith/DQ2GPPLCSPQBKZZZRSL6WH24LD/action/author_attestation","sign_citation":"https://pith.science/pith/DQ2GPPLCSPQBKZZZRSL6WH24LD/action/citation_signature","submit_replication":"https://pith.science/pith/DQ2GPPLCSPQBKZZZRSL6WH24LD/action/replication_record"}},"created_at":"2026-05-18T04:05:56.513231+00:00","updated_at":"2026-05-18T04:05:56.513231+00:00"}