{"doi":"10.1145/390013.808487","title":"Effectiveness of an optimizing compiler for arithmetic expressions","abstract":"<jats:p>This paper defines the notion of effectiveness of an optimizing compiler and presents a proof that a simple optimizing compiler is effective. An optimizing compiler typically consists of a basic compiler and a set of optimizations for special cases. The fundamental notion of effectiveness is that the basic compiler is correct, all of the optimization transformations preserve correctness, and produce essentially equivalent programs which have a smaller value relative to a specified weighting function.</jats:p>","journal":"ACM SIGPLAN Notices","year":1970,"id":29855,"datarank":0.1464184609643506,"base_score":0.6931471805599453,"endowment":0.6931471805599453,"self_citation_contribution":0.10397207708399181,"citation_network_contribution":0.04244638388035879,"self_endowment_contribution":0.10397207708399181,"citer_contribution":0.04244638388035879,"corpus_percentile":null,"corpus_rank":null,"citation_count":1,"citer_count":1,"citers_with_citation_signal":1,"citers_with_endowment":1,"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":163612,"name":"James A. Painter","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":0.6931471805599453,"endowment":0.6931471805599453,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"18998881","pmcid":null,"openalex_id":"https://openalex.org/W2121223013","authors":[],"funders":[],"total_grants":0,"fwci":0.0,"citation_percentile":0.32962138,"influential_citations":0,"citation_trend":[{"year":2013,"count":1}],"oa_status":"closed","license":"https://www.acm.org/publications/policies/copyright_policy#Background","oa_locations":[{"url":"https://dl.acm.org/doi/10.1145/390013.808487","host_type":"publisher"},{"url":"https://dl.acm.org/doi/pdf/10.1145/390013.808487","host_type":"publisher"},{"url":"https://doi.org/10.1145/390013.808487","host_type":"journal"}],"fields_of_study":["Parallel Computing and Optimization Techniques","Logic, programming, and type systems","Numerical Methods and Algorithms"],"mesh_terms":[],"keywords":["Compiler","Computer science","Interprocedural optimization","Compiler correctness","Optimizing compiler","Loop optimization","Correctness","Programming language","Compiler construction","Set (abstract data type)","Simple (philosophy)","Function (biology)","Parallel computing"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-09T00:57:32.516072Z","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":[]}