{"id":"https://openalex.org/W2052902739","doi":"https://doi.org/10.1145/2259016.2259042","title":"Using graph-based program characterization for predictive modeling","display_name":"Using graph-based program characterization for predictive modeling","publication_year":2012,"publication_date":"2012-03-31","ids":{"openalex":"https://openalex.org/W2052902739","doi":"https://doi.org/10.1145/2259016.2259042","mag":"2052902739"},"language":"en","primary_location":{"id":"doi:10.1145/2259016.2259042","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2259016.2259042","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Tenth International Symposium on Code Generation and Optimization","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/A5087664139","display_name":"Eun\u2010Jung Park","orcid":"https://orcid.org/0000-0002-3586-5800"},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eunjung Park","raw_affiliation_strings":["University of Delaware"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Delaware","institution_ids":["https://openalex.org/I86501945"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103791820","display_name":"John Cavazos","orcid":null},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Cavazos","raw_affiliation_strings":["University of Delaware"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Delaware","institution_ids":["https://openalex.org/I86501945"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046665875","display_name":"Marco \u00c1lvarez","orcid":"https://orcid.org/0000-0002-8528-5089"},"institutions":[{"id":"https://openalex.org/I121980950","display_name":"Utah State University","ror":"https://ror.org/00h6set76","country_code":"US","type":"education","lineage":["https://openalex.org/I121980950"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marco A. Alvarez","raw_affiliation_strings":["Utah State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Utah State University","institution_ids":["https://openalex.org/I121980950"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.222,"has_fulltext":false,"cited_by_count":76,"citation_normalized_percentile":{"value":0.91726196,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"196","last_page":"206"},"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.9994000196456909,"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.9994000196456909,"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/T10260","display_name":"Software Engineering Research","score":0.9959999918937683,"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"}},{"id":"https://openalex.org/T12127","display_name":"Software System Performance and Reliability","score":0.9914000034332275,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8748483657836914},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.7454953789710999},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.6801871657371521},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.589615523815155},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.5731521248817444},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5083712935447693},{"id":"https://openalex.org/keywords/dynamic-program-analysis","display_name":"Dynamic program analysis","score":0.5068297982215881},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.501183032989502},{"id":"https://openalex.org/keywords/call-graph","display_name":"Call graph","score":0.4957490861415863},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48382964730262756},{"id":"https://openalex.org/keywords/static-program-analysis","display_name":"Static program analysis","score":0.4596952497959137},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.4301994740962982},{"id":"https://openalex.org/keywords/compile-time","display_name":"Compile time","score":0.4297446310520172},{"id":"https://openalex.org/keywords/computer-engineering","display_name":"Computer engineering","score":0.3599259853363037},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3437439203262329},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31717920303344727},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.213327556848526},{"id":"https://openalex.org/keywords/software-development","display_name":"Software development","score":0.11214303970336914}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8748483657836914},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.7454953789710999},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.6801871657371521},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.589615523815155},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.5731521248817444},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5083712935447693},{"id":"https://openalex.org/C140006998","wikidata":"https://www.wikidata.org/wiki/Q2499307","display_name":"Dynamic program analysis","level":3,"score":0.5068297982215881},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.501183032989502},{"id":"https://openalex.org/C102379954","wikidata":"https://www.wikidata.org/wiki/Q2589940","display_name":"Call graph","level":2,"score":0.4957490861415863},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48382964730262756},{"id":"https://openalex.org/C137287247","wikidata":"https://www.wikidata.org/wiki/Q1329550","display_name":"Static program analysis","level":4,"score":0.4596952497959137},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.4301994740962982},{"id":"https://openalex.org/C200833197","wikidata":"https://www.wikidata.org/wiki/Q333707","display_name":"Compile time","level":3,"score":0.4297446310520172},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.3599259853363037},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3437439203262329},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31717920303344727},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.213327556848526},{"id":"https://openalex.org/C529173508","wikidata":"https://www.wikidata.org/wiki/Q638608","display_name":"Software development","level":3,"score":0.11214303970336914},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2259016.2259042","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2259016.2259042","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Tenth International Symposium on Code Generation and Optimization","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.369.9572","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.369.9572","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecis.udel.edu/~cavazos/cgo-2012.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6868438651","display_name":null,"funder_award_id":"953667","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1542652324","https://openalex.org/W1560724230","https://openalex.org/W1562470308","https://openalex.org/W1576213419","https://openalex.org/W1967846636","https://openalex.org/W2033139628","https://openalex.org/W2056579078","https://openalex.org/W2089806214","https://openalex.org/W2098180475","https://openalex.org/W2106057110","https://openalex.org/W2108737583","https://openalex.org/W2116466695","https://openalex.org/W2131479089","https://openalex.org/W2142079700","https://openalex.org/W2143124065","https://openalex.org/W2143161696","https://openalex.org/W2147286743","https://openalex.org/W2156286566","https://openalex.org/W2156560068","https://openalex.org/W2167209023","https://openalex.org/W2168519934","https://openalex.org/W2170216784","https://openalex.org/W2171539112","https://openalex.org/W2419658023","https://openalex.org/W2911717821","https://openalex.org/W2911738047","https://openalex.org/W3146578712"],"related_works":["https://openalex.org/W1601646354","https://openalex.org/W2086733238","https://openalex.org/W2078700326","https://openalex.org/W283806354","https://openalex.org/W1482645738","https://openalex.org/W1603968847","https://openalex.org/W60611840","https://openalex.org/W2106959667","https://openalex.org/W3177786601","https://openalex.org/W4384832145"],"abstract_inverted_index":{"Using":[0],"machine":[1,18],"learning":[2,19],"has":[3],"proven":[4],"effective":[5],"at":[6],"choosing":[7],"the":[8,34,66,69,102,119,154],"right":[9],"set":[10],"of":[11,32,51,71,82,110,118,129],"optimizations":[12,73],"for":[13,42],"a":[14,47,83,127],"particular":[15],"program.":[16,67,120,155],"For":[17,68],"techniques":[20,41],"to":[21,28,74,88,116,125],"be":[22,114,123],"most":[23],"effective,":[24],"compiler":[25],"writers":[26],"have":[27,85,126],"develop":[29],"expressive":[30,135],"means":[31],"characterizing":[33,43,111,130],"program":[35,84,103],"being":[36],"optimized.":[37],"The":[38],"current":[39],"state-of-the-art":[40],"programs":[44,112,131],"include":[45],"using":[46,78,92],"fixed-length":[48],"feature":[49],"vector":[50],"either":[52],"source":[53,93,145],"code":[54,94,146],"features":[55,147],"extracted":[56],"during":[57],"compile":[58],"time":[59],"or":[60],"performance":[61,79,98,137],"counters":[62,99],"collected":[63],"when":[64],"running":[65,101,153],"problem":[70],"identifying":[72],"apply,":[75],"models":[76,90],"constructed":[77,91],"counter":[80,138],"characterizations":[81],"been":[86],"shown":[87],"outperform":[89],"features.":[95],"However,":[96],"collecting":[97],"requires":[100],"multiple":[104],"times,":[105],"and":[106,148],"this":[107],"\"dynamic\"":[108],"method":[109,128],"can":[113],"specific":[115],"inputs":[117],"It":[121],"would":[122],"preferable":[124],"that":[132,141],"is":[133,142],"as":[134,136],"features,":[139],"but":[140],"\"static\"":[143],"like":[144],"therefore":[149],"does":[150],"not":[151],"require":[152]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}