{"doi":"10.1145/173262.155094","title":"Efficient accommodation of may-alias information in SSA form","abstract":"<jats:p>We present an algorithm for incrementally including may-alias information into Static Single Assignment form by computing a sequence of increasingly precise (and correspondingly larger) partial SSA forms. Our experiments show significant speedup of our method over exhaustive use of may-alias information, as optimization problems converge well before most may-aliases are needed.</jats:p>","journal":"ACM SIGPLAN Notices","year":1993,"id":14265,"datarank":1.2935859582759577,"base_score":2.302585092994046,"endowment":2.302585092994046,"self_citation_contribution":0.3453877639491069,"citation_network_contribution":0.9481981943268508,"self_endowment_contribution":0.3453877639491069,"citer_contribution":0.9481981943268508,"corpus_percentile":null,"corpus_rank":null,"citation_count":9,"citer_count":9,"citers_with_citation_signal":8,"citers_with_endowment":8,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":111777,"name":"Reid Gershbein","orcid":null,"position":1,"is_corresponding":false},{"id":111776,"name":"Ron Cytron","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":2.302585092994046,"endowment":2.302585092994046,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"24259432","pmcid":null,"openalex_id":"https://openalex.org/W2997042634","authors":[],"funders":[],"total_grants":0,"fwci":0.0,"citation_percentile":0.39179104,"influential_citations":0,"citation_trend":[{"year":2012,"count":1},{"year":2015,"count":2},{"year":2016,"count":1}],"oa_status":"bronze","license":"https://www.acm.org/publications/policies/copyright_policy#Background","oa_locations":[{"url":"https://dl.acm.org/doi/pdf/10.1145/173262.155094","host_type":"journal"},{"url":"https://dl.acm.org/doi/pdf/10.1145/173262.155094","host_type":"BRONZE"},{"url":"https://dl.acm.org/doi/pdf/10.1145/173262.155094","host_type":"publisher"},{"url":"https://dl.acm.org/doi/10.1145/173262.155094","host_type":"publisher"},{"url":"https://doi.org/10.1145/173262.155094","host_type":"journal"}],"fields_of_study":["Parallel Computing and Optimization Techniques","Algorithms and Data Compression","Logic, programming, and type systems","Computer Science"],"mesh_terms":[],"keywords":["Alias","Computer science","Speedup","Sequence (biology)","Parallel computing","Algorithm","Theoretical computer science","Data mining"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-01T07:21:15.817753Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}