{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:M67MBRF7WCZ7T7H2Z64KKOKFFJ","short_pith_number":"pith:M67MBRF7","schema_version":"1.0","canonical_sha256":"67bec0c4bfb0b3f9fcfacfb8a539452a7997fa93eea44ab952a95e2830f54fdc","source":{"kind":"arxiv","id":"1409.7509","version":2},"attestation_state":"computed","paper":{"title":"Expression-based aliasing for OO-languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.PL","authors_text":"Georgiana Caltais","submitted_at":"2014-09-26T09:19:31Z","abstract_excerpt":"Alias analysis has been an interesting research topic in verification and optimization of programs. The undecidability of determining whether two expressions in a program may reference to the same object is the main source of the challenges raised in alias analysis. In this paper we propose an extension of a previously introduced alias calculus based on program expressions, to the setting of unbounded program executions s.a. infinite loops and recursive calls. Moreover, we devise a corresponding executable specification in the K-framework. An important property of our extension is that, in a n"},"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":"1409.7509","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-09-26T09:19:31Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"10a9a75a26281d571d33e141834cf4df741ece0488c4e81347a628e7b5544311","abstract_canon_sha256":"ea1dde2244d511d607f3cc3d04e8d8406c3c346110acc65aedd838ba1f9336b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:47.800149Z","signature_b64":"zzBDeplR4X/lhLHY/IubCsyyyXQVt0LJcp4uorJx3ghW163sitBGNUC7uPyrJzZKfuSH/vxHKroGugN6wCQMCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67bec0c4bfb0b3f9fcfacfb8a539452a7997fa93eea44ab952a95e2830f54fdc","last_reissued_at":"2026-05-18T02:39:47.799767Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:47.799767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Expression-based aliasing for OO-languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.PL","authors_text":"Georgiana Caltais","submitted_at":"2014-09-26T09:19:31Z","abstract_excerpt":"Alias analysis has been an interesting research topic in verification and optimization of programs. The undecidability of determining whether two expressions in a program may reference to the same object is the main source of the challenges raised in alias analysis. In this paper we propose an extension of a previously introduced alias calculus based on program expressions, to the setting of unbounded program executions s.a. infinite loops and recursive calls. Moreover, we devise a corresponding executable specification in the K-framework. An important property of our extension is that, in a n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7509","kind":"arxiv","version":2},"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":"1409.7509","created_at":"2026-05-18T02:39:47.799823+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.7509v2","created_at":"2026-05-18T02:39:47.799823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7509","created_at":"2026-05-18T02:39:47.799823+00:00"},{"alias_kind":"pith_short_12","alias_value":"M67MBRF7WCZ7","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"M67MBRF7WCZ7T7H2","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"M67MBRF7","created_at":"2026-05-18T12:28:38.356838+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/M67MBRF7WCZ7T7H2Z64KKOKFFJ","json":"https://pith.science/pith/M67MBRF7WCZ7T7H2Z64KKOKFFJ.json","graph_json":"https://pith.science/api/pith-number/M67MBRF7WCZ7T7H2Z64KKOKFFJ/graph.json","events_json":"https://pith.science/api/pith-number/M67MBRF7WCZ7T7H2Z64KKOKFFJ/events.json","paper":"https://pith.science/paper/M67MBRF7"},"agent_actions":{"view_html":"https://pith.science/pith/M67MBRF7WCZ7T7H2Z64KKOKFFJ","download_json":"https://pith.science/pith/M67MBRF7WCZ7T7H2Z64KKOKFFJ.json","view_paper":"https://pith.science/paper/M67MBRF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.7509&json=true","fetch_graph":"https://pith.science/api/pith-number/M67MBRF7WCZ7T7H2Z64KKOKFFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/M67MBRF7WCZ7T7H2Z64KKOKFFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M67MBRF7WCZ7T7H2Z64KKOKFFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M67MBRF7WCZ7T7H2Z64KKOKFFJ/action/storage_attestation","attest_author":"https://pith.science/pith/M67MBRF7WCZ7T7H2Z64KKOKFFJ/action/author_attestation","sign_citation":"https://pith.science/pith/M67MBRF7WCZ7T7H2Z64KKOKFFJ/action/citation_signature","submit_replication":"https://pith.science/pith/M67MBRF7WCZ7T7H2Z64KKOKFFJ/action/replication_record"}},"created_at":"2026-05-18T02:39:47.799823+00:00","updated_at":"2026-05-18T02:39:47.799823+00:00"}