{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7ZA7UAQWQWYSMKUQTIVXBCT7FN","short_pith_number":"pith:7ZA7UAQW","schema_version":"1.0","canonical_sha256":"fe41fa021685b1262a909a2b708a7f2b6d989cf9a6aa5cb614c41ed2d729554d","source":{"kind":"arxiv","id":"1701.05650","version":1},"attestation_state":"computed","paper":{"title":"Demand-Driven Pointer Analysis with Strong Updates via Value-Flow Refinement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.PL","authors_text":"Jingling Xue, Yulei Sui","submitted_at":"2017-01-20T00:51:09Z","abstract_excerpt":"We present a new demand-driven flow- and context-sensitive pointer analysis with strong updates for C programs, called SUPA, that enables computing points-to information via value-flow refinement, in environments with small time and memory budgets such as IDEs. We formulate SUPA by solving a graph reachability problem on an inter-procedural value-flow graph representing a program's def-use chains, which are pre-computed efficiently but over-approximately. To answer a client query (a request for a variable's points-to set), SUPA reasons about the flow of values along the pre-computed def-use ch"},"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":"1701.05650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-20T00:51:09Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"c8b4d6b59a99327cf377af83e02814777318fc25aba4e9f71492b41dcdd52ffe","abstract_canon_sha256":"b79b7a4be893ea8053dd8af8ca26fb9f77cbd636076fab53f119bee35ce7b536"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:28.885352Z","signature_b64":"Jne5vJ83NDAsshB1FpcyDJ38FQVIk1DvT+43lPwi6iO3sTGqq/DRPim36I35YY9zVGB0i1AI8f1dxWQoowp9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe41fa021685b1262a909a2b708a7f2b6d989cf9a6aa5cb614c41ed2d729554d","last_reissued_at":"2026-05-18T00:52:28.884777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:28.884777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Demand-Driven Pointer Analysis with Strong Updates via Value-Flow Refinement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.PL","authors_text":"Jingling Xue, Yulei Sui","submitted_at":"2017-01-20T00:51:09Z","abstract_excerpt":"We present a new demand-driven flow- and context-sensitive pointer analysis with strong updates for C programs, called SUPA, that enables computing points-to information via value-flow refinement, in environments with small time and memory budgets such as IDEs. We formulate SUPA by solving a graph reachability problem on an inter-procedural value-flow graph representing a program's def-use chains, which are pre-computed efficiently but over-approximately. To answer a client query (a request for a variable's points-to set), SUPA reasons about the flow of values along the pre-computed def-use ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05650","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":"1701.05650","created_at":"2026-05-18T00:52:28.884859+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.05650v1","created_at":"2026-05-18T00:52:28.884859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05650","created_at":"2026-05-18T00:52:28.884859+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ZA7UAQWQWYS","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ZA7UAQWQWYSMKUQ","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ZA7UAQW","created_at":"2026-05-18T12:31:05.417338+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/7ZA7UAQWQWYSMKUQTIVXBCT7FN","json":"https://pith.science/pith/7ZA7UAQWQWYSMKUQTIVXBCT7FN.json","graph_json":"https://pith.science/api/pith-number/7ZA7UAQWQWYSMKUQTIVXBCT7FN/graph.json","events_json":"https://pith.science/api/pith-number/7ZA7UAQWQWYSMKUQTIVXBCT7FN/events.json","paper":"https://pith.science/paper/7ZA7UAQW"},"agent_actions":{"view_html":"https://pith.science/pith/7ZA7UAQWQWYSMKUQTIVXBCT7FN","download_json":"https://pith.science/pith/7ZA7UAQWQWYSMKUQTIVXBCT7FN.json","view_paper":"https://pith.science/paper/7ZA7UAQW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.05650&json=true","fetch_graph":"https://pith.science/api/pith-number/7ZA7UAQWQWYSMKUQTIVXBCT7FN/graph.json","fetch_events":"https://pith.science/api/pith-number/7ZA7UAQWQWYSMKUQTIVXBCT7FN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ZA7UAQWQWYSMKUQTIVXBCT7FN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ZA7UAQWQWYSMKUQTIVXBCT7FN/action/storage_attestation","attest_author":"https://pith.science/pith/7ZA7UAQWQWYSMKUQTIVXBCT7FN/action/author_attestation","sign_citation":"https://pith.science/pith/7ZA7UAQWQWYSMKUQTIVXBCT7FN/action/citation_signature","submit_replication":"https://pith.science/pith/7ZA7UAQWQWYSMKUQTIVXBCT7FN/action/replication_record"}},"created_at":"2026-05-18T00:52:28.884859+00:00","updated_at":"2026-05-18T00:52:28.884859+00:00"}