{"id":"https://openalex.org/W7118181368","doi":"https://doi.org/10.1109/aiccsa66935.2025.11315210","title":"A Data-driven Analysis of Code Optimizations","display_name":"A Data-driven Analysis of Code Optimizations","publication_year":2025,"publication_date":"2025-10-19","ids":{"openalex":"https://openalex.org/W7118181368","doi":"https://doi.org/10.1109/aiccsa66935.2025.11315210"},"language":null,"primary_location":{"id":"doi:10.1109/aiccsa66935.2025.11315210","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aiccsa66935.2025.11315210","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE/ACS 22nd International Conference on Computer Systems and Applications (AICCSA)","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/A5040778696","display_name":"Yacine Hakimi","orcid":"https://orcid.org/0009-0005-4820-8091"},"institutions":[{"id":"https://openalex.org/I4210149016","display_name":"\u00c9cole Nationale Sup\u00e9rieure d'Informatique","ror":"https://ror.org/04dj1dn66","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210149016"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Yacine Hakimi","raw_affiliation_strings":["Ecole Superieure d’Informatique,Algiers,Algeria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ecole Superieure d’Informatique,Algiers,Algeria","institution_ids":["https://openalex.org/I4210149016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044704994","display_name":"Riyadh Baghdadi","orcid":"https://orcid.org/0000-0002-9350-3998"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Riyadh Baghdadi","raw_affiliation_strings":["New York University Abu Dhabi,Abu Dhabi,UAE"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"New York University Abu Dhabi,Abu Dhabi,UAE","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.54411765,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.4959000051021576,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.4959000051021576,"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.15199999511241913,"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/T10260","display_name":"Software Engineering Research","score":0.05570000037550926,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/compiler","display_name":"Compiler","score":0.7588000297546387},{"id":"https://openalex.org/keywords/program-optimization","display_name":"Program optimization","score":0.7063999772071838},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.6284000277519226},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.5911999940872192},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5684000253677368},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.5523999929428101},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.48559999465942383},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.4787999987602234},{"id":"https://openalex.org/keywords/dead-code-elimination","display_name":"Dead code elimination","score":0.40059998631477356}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8321999907493591},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.7588000297546387},{"id":"https://openalex.org/C139571649","wikidata":"https://www.wikidata.org/wiki/Q1156793","display_name":"Program optimization","level":3,"score":0.7063999772071838},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6284000277519226},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.5911999940872192},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5684000253677368},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.5523999929428101},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.49559998512268066},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.48559999465942383},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4787999987602234},{"id":"https://openalex.org/C2144512","wikidata":"https://www.wikidata.org/wiki/Q1143090","display_name":"Dead code elimination","level":5,"score":0.40059998631477356},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.34130001068115234},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3246999979019165},{"id":"https://openalex.org/C137287247","wikidata":"https://www.wikidata.org/wiki/Q1329550","display_name":"Static program analysis","level":4,"score":0.31209999322891235},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.30300000309944153},{"id":"https://openalex.org/C2777394884","wikidata":"https://www.wikidata.org/wiki/Q762268","display_name":"Automatic programming","level":2,"score":0.2946999967098236},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.28610000014305115},{"id":"https://openalex.org/C126661757","wikidata":"https://www.wikidata.org/wiki/Q4925641","display_name":"Random search","level":2,"score":0.28380000591278076},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2809000015258789},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.27959999442100525},{"id":"https://openalex.org/C2778361913","wikidata":"https://www.wikidata.org/wiki/Q7248437","display_name":"Program transformation","level":2,"score":0.27219998836517334},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.2702000141143799},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.2676999866962433},{"id":"https://openalex.org/C47434764","wikidata":"https://www.wikidata.org/wiki/Q1770035","display_name":"Dead code","level":5,"score":0.2599000036716461},{"id":"https://openalex.org/C29331672","wikidata":"https://www.wikidata.org/wiki/Q3354468","display_name":"Loop optimization","level":4,"score":0.2517000138759613}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/aiccsa66935.2025.11315210","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aiccsa66935.2025.11315210","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE/ACS 22nd International Conference on Computer Systems and Applications (AICCSA)","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.5433046221733093}],"awards":[],"funders":[{"id":"https://openalex.org/F4320319918","display_name":"York University","ror":"https://ror.org/05fq50484"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W2007962166","https://openalex.org/W2102976251","https://openalex.org/W2146405378","https://openalex.org/W2152506070","https://openalex.org/W2783614532","https://openalex.org/W2949967139","https://openalex.org/W2962724414","https://openalex.org/W3151489216","https://openalex.org/W4210409048","https://openalex.org/W4386968162"],"related_works":[],"abstract_inverted_index":{"As":[0],"the":[1,27,90,95,102,120,140,176],"demand":[2],"for":[3,35],"computational":[4],"power":[5],"grows,":[6],"optimizing":[7],"code":[8,22,33,144,182],"through":[9],"compilers":[10],"becomes":[11],"increasingly":[12],"crucial.":[13],"In":[14,127],"this":[15,128,132],"context,":[16],"we":[17,130,151,171],"focus":[18],"on":[19],"fully":[20],"automatic":[21,143,181],"optimization":[23,54,125,145,161,183],"techniques":[24],"that":[25,137,174],"automate":[26],"process":[28],"of":[29,115,142,156,178],"selecting":[30],"and":[31,46,133,163],"applying":[32,116],"transformations":[34,44,75,117],"better":[36],"performance":[37,97],"without":[38,122],"manual":[39],"intervention.":[40],"Understanding":[41],"how":[42],"these":[43,65],"behave":[45],"interact":[47],"is":[48],"key":[49],"to":[50,73,76,84],"designing":[51],"more":[52,179],"effective":[53],"strategies.":[55],"Compiler":[56],"developers":[57],"must":[58],"make":[59],"numerous":[60],"design":[61,141],"choices":[62],"when":[63],"constructing":[64],"heuristics.":[66],"For":[67],"instance,":[68],"they":[69],"may":[70,92],"decide":[71],"whether":[72],"allow":[74],"be":[77],"explored":[78],"in":[79,139],"any":[80],"arbitrary":[81],"order":[82,114],"or":[83],"enforce":[85],"a":[86,111,148,153],"fixed":[87,113],"sequence.":[88],"While":[89],"former":[91],"theoretically":[93],"offer":[94],"best":[96],"gains,":[98],"it":[99],"significantly":[100],"increases":[101],"search":[103,121],"space.":[104],"This":[105],"raises":[106],"an":[107],"important":[108],"question:":[109],"Can":[110],"predefined,":[112],"speed":[118],"up":[119],"severely":[123],"compromising":[124],"potential?":[126],"paper,":[129],"address":[131],"other":[134],"related":[135],"questions":[136],"arise":[138],"algorithms.":[146,184],"Using":[147],"data-driven":[149],"approach,":[150],"generate":[152],"large":[154],"dataset":[155],"random":[157,160],"programs,":[158],"apply":[159],"sequences,":[162],"record":[164],"their":[165],"execution":[166],"times.":[167],"Through":[168],"statistical":[169],"analysis,":[170],"provide":[172],"insights":[173],"guide":[175],"development":[177],"efficient":[180]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-01-05T00:00:00"}