{"id":"https://openalex.org/W2160145830","doi":"https://doi.org/10.1145/1168857.1168906","title":"Automatic generation of peephole superoptimizers","display_name":"Automatic generation of peephole superoptimizers","publication_year":2006,"publication_date":"2006-10-20","ids":{"openalex":"https://openalex.org/W2160145830","doi":"https://doi.org/10.1145/1168857.1168906","mag":"2160145830"},"language":"en","primary_location":{"id":"doi:10.1145/1168857.1168906","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1168857.1168906","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th international conference on Architectural support for programming languages and operating systems","raw_type":"proceedings-article"},"type":"article","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/A5101727565","display_name":"Sorav Bansal","orcid":"https://orcid.org/0009-0004-2006-9635"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sorav Bansal","raw_affiliation_strings":["Stanford University"],"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087402475","display_name":"Alex Aiken","orcid":"https://orcid.org/0000-0002-3723-9555"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alex Aiken","raw_affiliation_strings":["Stanford University"],"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101727565"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":4.6843,"has_fulltext":false,"cited_by_count":165,"citation_normalized_percentile":{"value":0.9478678,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"394","last_page":"403"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.992900013923645,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.992900013923645,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9854000210762024,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9166066646575928},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.7578589916229248},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.6717122197151184},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.5433619022369385},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5189399719238281},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5011959075927734},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.48503750562667847},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.37719717621803284},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.35445183515548706}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9166066646575928},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.7578589916229248},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6717122197151184},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.5433619022369385},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5189399719238281},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5011959075927734},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.48503750562667847},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.37719717621803284},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.35445183515548706},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1168857.1168906","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1168857.1168906","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th international conference on Architectural support for programming languages and operating systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1524336136","https://openalex.org/W1575174358","https://openalex.org/W1967022475","https://openalex.org/W2002749185","https://openalex.org/W2054572543","https://openalex.org/W2096307462","https://openalex.org/W2114012357","https://openalex.org/W2142785340","https://openalex.org/W2150871888","https://openalex.org/W2160401437","https://openalex.org/W3004544459","https://openalex.org/W4238321249","https://openalex.org/W4301666354"],"related_works":["https://openalex.org/W2002505081","https://openalex.org/W2083681681","https://openalex.org/W2577630842","https://openalex.org/W1172579163","https://openalex.org/W1488300410","https://openalex.org/W2138790427","https://openalex.org/W4246454774","https://openalex.org/W2162051035","https://openalex.org/W1597127505","https://openalex.org/W3146558274"],"abstract_inverted_index":{"Peephole":[0],"optimizers":[1,37],"are":[2],"typically":[3],"constructed":[4],"using":[5,38],"human-written":[6,55],"pattern":[7],"matching":[8],"rules,":[9],"an":[10],"approach":[11,58],"that":[12,86],"requires":[13],"expertise":[14],"and":[15],"time,":[16],"as":[17,19],"well":[18],"being":[20],"less":[21,52],"than":[22,54],"systematic":[23],"at":[24],"exploiting":[25],"all":[26],"opportunities":[27,94],"for":[28],"optimization.":[29],"We":[30,83],"explore":[31],"fully":[32],"automatic":[33,48],"construction":[34],"of":[35,67,71,110],"peephole":[36,81],"brute":[39],"force":[40],"superoptimization.":[41],"While":[42],"the":[43,60,76],"optimizations":[44],"discovered":[45],"by":[46,97],"our":[47,57,87],"system":[49],"may":[50],"be":[51],"general":[53],"counterparts,":[56],"has":[59],"potential":[61],"to":[62,69,75,91,107],"automatically":[63],"learn":[64],"a":[65,108,118],"database":[66],"thousands":[68],"millions":[70],"optimizations,":[72],"in":[73,79,100],"contrast":[74],"hundreds":[77],"found":[78,96],"current":[80],"optimizers.":[82],"show":[84,103],"experimentally":[85],"optimizer":[88],"is":[89],"able":[90],"exploit":[92],"performance":[93],"not":[95],"existing":[98],"compilers;":[99],"particular,":[101],"we":[102],"speedups":[104],"from":[105],"1.7":[106],"factor":[109],"10":[111],"on":[112],"some":[113],"compute":[114],"intensive":[115],"kernels":[116],"over":[117],"conventional":[119],"optimizing":[120],"compiler.":[121]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":14},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":16},{"year":2015,"cited_by_count":16},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-12T08:34:05.389933","created_date":"2025-10-10T00:00:00"}