{"id":"https://openalex.org/W2150270953","doi":"https://doi.org/10.1109/scam.2003.1238046","title":"Results from a large-scale study of performance optimization techniques for source code analyses based on graph reachability algorithms","display_name":"Results from a large-scale study of performance optimization techniques for source code analyses based on graph reachability algorithms","publication_year":2004,"publication_date":"2004-03-02","ids":{"openalex":"https://openalex.org/W2150270953","doi":"https://doi.org/10.1109/scam.2003.1238046","mag":"2150270953"},"language":"en","primary_location":{"id":"doi:10.1109/scam.2003.1238046","is_oa":false,"landing_page_url":"https://doi.org/10.1109/scam.2003.1238046","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings Third IEEE International Workshop on Source Code Analysis and Manipulation","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/A5008760456","display_name":"David Binkley","orcid":"https://orcid.org/0000-0003-0059-4024"},"institutions":[{"id":"https://openalex.org/I165556055","display_name":"Loyola University Maryland","ror":"https://ror.org/01by1wp65","country_code":"US","type":"education","lineage":["https://openalex.org/I165556055"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"D. Binkley","raw_affiliation_strings":["Loyola College, Baltimore, MD, USA"],"affiliations":[{"raw_affiliation_string":"Loyola College, Baltimore, MD, USA","institution_ids":["https://openalex.org/I165556055"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000019783","display_name":"Mark Harman","orcid":"https://orcid.org/0000-0002-5864-4488"},"institutions":[{"id":"https://openalex.org/I189462010","display_name":"Universiti Brunei Darussalam","ror":"https://ror.org/02qnf3n86","country_code":"BN","type":"education","lineage":["https://openalex.org/I189462010"]}],"countries":["BN"],"is_corresponding":false,"raw_author_name":"M. Harman","raw_affiliation_strings":["Brunei University, Uxbridge, UK"],"affiliations":[{"raw_affiliation_string":"Brunei University, Uxbridge, UK","institution_ids":["https://openalex.org/I189462010"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008760456"],"corresponding_institution_ids":["https://openalex.org/I165556055"],"apc_list":null,"apc_paid":null,"fwci":3.8348,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.92977439,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"203","last_page":"212"},"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.9997000098228455,"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.9997000098228455,"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/T10260","display_name":"Software Engineering Research","score":0.9995999932289124,"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.9977999925613403,"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.7961423993110657},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7599807977676392},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.5760717988014221},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5292707681655884},{"id":"https://openalex.org/keywords/call-graph","display_name":"Call graph","score":0.5203901529312134},{"id":"https://openalex.org/keywords/data-flow-analysis","display_name":"Data-flow analysis","score":0.5111866593360901},{"id":"https://openalex.org/keywords/graph-reduction","display_name":"Graph reduction","score":0.4575656056404114},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4431523084640503},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.4336748421192169},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.4312880337238312},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33852821588516235},{"id":"https://openalex.org/keywords/data-flow-diagram","display_name":"Data flow diagram","score":0.3009273409843445},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3008360266685486},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.09333693981170654},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.09328076243400574}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7961423993110657},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7599807977676392},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.5760717988014221},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5292707681655884},{"id":"https://openalex.org/C102379954","wikidata":"https://www.wikidata.org/wiki/Q2589940","display_name":"Call graph","level":2,"score":0.5203901529312134},{"id":"https://openalex.org/C88468194","wikidata":"https://www.wikidata.org/wiki/Q1172416","display_name":"Data-flow analysis","level":3,"score":0.5111866593360901},{"id":"https://openalex.org/C97042676","wikidata":"https://www.wikidata.org/wiki/Q5597097","display_name":"Graph reduction","level":3,"score":0.4575656056404114},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4431523084640503},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.4336748421192169},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.4312880337238312},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33852821588516235},{"id":"https://openalex.org/C489000","wikidata":"https://www.wikidata.org/wiki/Q747385","display_name":"Data flow diagram","level":2,"score":0.3009273409843445},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3008360266685486},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.09333693981170654},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.09328076243400574}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/scam.2003.1238046","is_oa":false,"landing_page_url":"https://doi.org/10.1109/scam.2003.1238046","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings Third IEEE International Workshop on Source Code Analysis and Manipulation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.41999998688697815}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1518828487","https://openalex.org/W1564248361","https://openalex.org/W1575308494","https://openalex.org/W1843902071","https://openalex.org/W1964060567","https://openalex.org/W2092483417","https://openalex.org/W2096525117","https://openalex.org/W2101462267","https://openalex.org/W2111695742","https://openalex.org/W2118564793","https://openalex.org/W2123523074","https://openalex.org/W2135988257","https://openalex.org/W2139471541","https://openalex.org/W2144344516","https://openalex.org/W2149598945","https://openalex.org/W2150487654","https://openalex.org/W2293624369","https://openalex.org/W2395196255","https://openalex.org/W4241211222","https://openalex.org/W6610773549","https://openalex.org/W6631139258","https://openalex.org/W6682218893"],"related_works":["https://openalex.org/W2052485000","https://openalex.org/W2081768685","https://openalex.org/W1585740239","https://openalex.org/W2122222797","https://openalex.org/W2925083478","https://openalex.org/W1972828985","https://openalex.org/W1986328875","https://openalex.org/W2388522952","https://openalex.org/W2373941076","https://openalex.org/W1984077225"],"abstract_inverted_index":{"Internally,":[0],"many":[1],"source":[2],"code":[3,136],"analysis":[4,62,88,111,119],"tools":[5,63,73],"make":[6],"use":[7,28,65],"of":[8,13,41,70,77,82,130,135,147,154,176,186],"graphs.":[9,67,79],"For":[10],"example,":[11],"one":[12],"the":[14,23,39,42,45,51,59,122,142,148,152,174,177],"oldest":[15],"and":[16,50,102],"most":[17],"widely":[18],"used":[19,114],"internal":[20,66],"graphs":[21],"is":[22,89,113,137],"control-flow":[24],"graph":[25,48,110,118],"developed":[26],"for":[27],"within":[29],"a":[30,75,108,116,127,158],"compiler.":[31],"Work":[32],"on":[33,144],"compilation":[34],"has":[35],"also":[36],"led":[37],"to":[38,64],"development":[40],"call":[43],"graph,":[44],"procedure":[46],"dependence":[47],"(PDG),":[49],"static-single":[52],"assignment":[53],"(SSA)":[54],"graph.":[55],"Compilers":[56],"are":[57,94],"not":[58],"only":[60],"source-code":[61],"A":[68,80],"variety":[69,76],"software":[71],"engineering":[72],"incorporate":[74],"different":[78,92],"study":[81],"techniques":[83,93,156],"that":[84,179],"improve":[85],"graph-based":[86],"program":[87],"presented.":[90,138],"Several":[91],"considered,":[95],"including":[96],"forming":[97],"strongly-connected":[98],"components,":[99],"topological":[100],"sorting,":[101],"removing":[103],"transitive":[104],"edges.":[105],"Graph":[106],"reachability,":[107],"pervasive":[109],"operation,":[112],"as":[115],"representative":[117],"operation":[120],"in":[121,161,166],"study.":[123],"Data":[124],"collected":[125],"from":[126],"test":[128],"bed":[129],"just":[131],"over":[132,187],"1000000":[133],"lines":[134],"This":[139],"data":[140],"illustrates":[141],"impact":[143],"computation":[145],"time":[146],"improvement":[149],"techniques.":[150],"Overall,":[151],"combination":[153],"all":[155],"produces":[157],"71%":[159],"reduction":[160,165],"run-time":[162],"(and":[163],"64%":[164],"memory":[167],"usage).":[168],"In":[169],"other":[170],"words,":[171],"they":[172],"increase":[173],"size":[175],"problem":[178],"can":[180],"be":[181],"effectively":[182],"handled":[183],"by":[184],"factor":[185],"three":[188],"times.":[189]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}