{"id":"https://openalex.org/W4248251197","doi":"https://doi.org/10.1145/1133981.1133989","title":"A framework for unrestricted whole-program optimization","display_name":"A framework for unrestricted whole-program optimization","publication_year":2006,"publication_date":"2006-06-11","ids":{"openalex":"https://openalex.org/W4248251197","doi":"https://doi.org/10.1145/1133981.1133989"},"language":"en","primary_location":{"id":"doi:10.1145/1133981.1133989","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1133981.1133989","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089203437","display_name":"Spyridon Triantafyllis","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Spyridon Triantafyllis","raw_affiliation_strings":["Princeton University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000445069","display_name":"Matthew J. Bridges","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matthew J. Bridges","raw_affiliation_strings":["Princeton University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052674252","display_name":"Easwaran Raman","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Easwaran Raman","raw_affiliation_strings":["Princeton University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070551934","display_name":"Guilherme Ottoni","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guilherme Ottoni","raw_affiliation_strings":["Princeton University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008319090","display_name":"David I. August","orcid":"https://orcid.org/0000-0003-3327-1803"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David I. August","raw_affiliation_strings":["Princeton University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":3.1093,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.92551893,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"61","last_page":"71"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8154560327529907},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.7605987191200256},{"id":"https://openalex.org/keywords/program-optimization","display_name":"Program optimization","score":0.6892218589782715},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5792116522789001},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5512654185295105},{"id":"https://openalex.org/keywords/compile-time","display_name":"Compile time","score":0.5248249173164368},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.49875593185424805},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.49389344453811646},{"id":"https://openalex.org/keywords/just-in-time-compilation","display_name":"Just-in-time compilation","score":0.481005996465683},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.4264400899410248},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.07074084877967834}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8154560327529907},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.7605987191200256},{"id":"https://openalex.org/C139571649","wikidata":"https://www.wikidata.org/wiki/Q1156793","display_name":"Program optimization","level":3,"score":0.6892218589782715},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5792116522789001},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5512654185295105},{"id":"https://openalex.org/C200833197","wikidata":"https://www.wikidata.org/wiki/Q333707","display_name":"Compile time","level":3,"score":0.5248249173164368},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.49875593185424805},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.49389344453811646},{"id":"https://openalex.org/C76782552","wikidata":"https://www.wikidata.org/wiki/Q110546","display_name":"Just-in-time compilation","level":3,"score":0.481005996465683},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.4264400899410248},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.07074084877967834}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1133981.1133989","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1133981.1133989","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.550000011920929}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W148396834","https://openalex.org/W1507552563","https://openalex.org/W1568418930","https://openalex.org/W1974909417","https://openalex.org/W1983166063","https://openalex.org/W2030400507","https://openalex.org/W2036162899","https://openalex.org/W2061884904","https://openalex.org/W2063255488","https://openalex.org/W2080573945","https://openalex.org/W2108475205","https://openalex.org/W2141080717","https://openalex.org/W2159389028","https://openalex.org/W2164795104","https://openalex.org/W2293873148","https://openalex.org/W4205241946","https://openalex.org/W4239453975","https://openalex.org/W4242680074"],"related_works":["https://openalex.org/W2004337747","https://openalex.org/W2061483729","https://openalex.org/W3004536583","https://openalex.org/W4254156924","https://openalex.org/W2023906971","https://openalex.org/W1577067912","https://openalex.org/W2102888818","https://openalex.org/W4233359889","https://openalex.org/W1565360684","https://openalex.org/W2111447644"],"abstract_inverted_index":{"Procedures":[0],"have":[1,38],"long":[2],"been":[3,39],"the":[4,62,87,91,123,146],"basic":[5],"units":[6],"of":[7,86,90,111,126],"compilation":[8,67,104],"in":[9,132],"conventional":[10],"optimization":[11,24],"frameworks.":[12],"However,":[13],"procedures":[14],"are":[15],"typically":[16],"formed":[17],"to":[18,41,47,81,98,102],"serve":[19],"software":[20],"engineering":[21],"rather":[22],"than":[23,142],"goals,":[25],"arbitrarily":[26],"constraining":[27],"code":[28,48,119,130,147],"transformations.":[29],"Techniques,":[30],"such":[31],"as":[32],"aggressive":[33],"inlining":[34,127,143],"and":[35,50,79,95,114],"interprocedural":[36],"optimization,":[37],"developed":[40],"alleviate":[42],"this":[43],"problem,":[44],"but,":[45],"due":[46],"growth":[49,131],"compile":[51],"time":[52],"issues,":[53],"these":[54],"can":[55],"be":[56],"applied":[57],"only":[58],"sparingly.This":[59],"paper":[60,135],"introduces":[61,108],"Procedure":[63],"Boundary":[64],"Elimination":[65],"(PBE)":[66],"framework,":[68],"which":[69,121],"allows":[70,75],"unrestricted":[71],"whole-program":[72],"optimization.":[73],"PBE":[74,106,116,138],"all":[76],"intra-procedural":[77],"optimizations":[78],"analyses":[80],"operate":[82],"on":[83],"arbitrary":[84],"subgraphs":[85],"program,":[88],"regardless":[89],"original":[92],"procedure":[93],"boundaries":[94],"without":[96],"resorting":[97],"inlining.":[99],"In":[100],"order":[101],"control":[103],"time,":[105],"also":[107],"novel":[109],"extensions":[110],"region":[112],"formation":[113],"encapsulation.":[115],"enables":[117],"targeted":[118],"specialization,":[120],"recovers":[122],"specialization":[124],"benefits":[125],"while":[128],"keeping":[129],"check.":[133],"This":[134],"shows":[136],"that":[137],"attains":[139],"better":[140],"performance":[141],"with":[144],"half":[145],"growth.":[148]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}