{"id":"https://openalex.org/W2097971650","doi":"https://doi.org/10.1145/2509136.2509521","title":"Ball-Larus path profiling across multiple loop iterations","display_name":"Ball-Larus path profiling across multiple loop iterations","publication_year":2013,"publication_date":"2013-10-23","ids":{"openalex":"https://openalex.org/W2097971650","doi":"https://doi.org/10.1145/2509136.2509521","mag":"2097971650"},"language":"en","primary_location":{"id":"doi:10.1145/2509136.2509521","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2509136.2509521","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications","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/A5067397962","display_name":"Daniele Cono D\u2019Elia","orcid":"https://orcid.org/0000-0003-4358-976X"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Daniele Cono D'Elia","raw_affiliation_strings":["Sapienza University of Rome, Rome, Italy","Sapienza university of Rome, Rome, Italy#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Sapienza university of Rome, Rome, Italy#TAB#","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066534034","display_name":"Camil Demetrescu","orcid":"https://orcid.org/0000-0002-4686-6745"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Camil Demetrescu","raw_affiliation_strings":["Sapienza University of Rome, Rome, Italy","Sapienza university of Rome, Rome, Italy#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Sapienza university of Rome, Rome, Italy#TAB#","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":null,"apc_paid":null,"fwci":1.3625,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.79578525,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"373","last_page":"390"},"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.9986000061035156,"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.9986000061035156,"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/T10126","display_name":"Logic, programming, and type systems","score":0.998199999332428,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9966999888420105,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6247484087944031},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45063701272010803},{"id":"https://openalex.org/keywords/profiling","display_name":"Profiling (computer programming)","score":0.441951721906662},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33926451206207275},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11002156138420105}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6247484087944031},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45063701272010803},{"id":"https://openalex.org/C187191949","wikidata":"https://www.wikidata.org/wiki/Q1138496","display_name":"Profiling (computer programming)","level":2,"score":0.441951721906662},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33926451206207275},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11002156138420105}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2509136.2509521","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2509136.2509521","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.770.6703","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.770.6703","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1304.5197.pdf","raw_type":"text"},{"id":"pmh:oai:iris.uniroma1.it:11573/536822","is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=2509521","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1613767","https://openalex.org/W1983166063","https://openalex.org/W1999362312","https://openalex.org/W2005795572","https://openalex.org/W2019240169","https://openalex.org/W2062444590","https://openalex.org/W2071187684","https://openalex.org/W2090394816","https://openalex.org/W2093226410","https://openalex.org/W2101134669","https://openalex.org/W2102839400","https://openalex.org/W2104809773","https://openalex.org/W2125002353","https://openalex.org/W2126874930","https://openalex.org/W2129962996","https://openalex.org/W2130711572","https://openalex.org/W2131781330","https://openalex.org/W2133753482","https://openalex.org/W2134499232","https://openalex.org/W2151881397","https://openalex.org/W2166091242","https://openalex.org/W2337480916","https://openalex.org/W4237311759","https://openalex.org/W4239289337","https://openalex.org/W4248649658"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"Identifying":[0],"the":[1,5,18,38,48,59,63,95,128,136,187],"hottest":[2],"paths":[3,141,213],"in":[4,37,47],"control":[6],"flow":[7],"graph":[8],"of":[9,17,58,97,106,127,138,146,183,211,218],"a":[10,103,113,144,156,180],"routine":[11],"can":[12,166,194],"direct":[13],"optimizations":[14],"to":[15,65,72,90,116,148,201],"portions":[16],"code":[19],"where":[20,153],"most":[21],"resources":[22],"are":[23],"consumed.":[24],"This":[25],"powerful":[26],"methodology,":[27],"called":[28],"path":[29,118],"profiling,":[30,119],"was":[31,62],"introduced":[32],"by":[33],"Ball":[34],"and":[35,42],"Larus":[36],"mid":[39],"90's":[40],"[4]":[41],"has":[43],"received":[44],"considerable":[45],"attention":[46],"last":[49],"15":[50],"years":[51],"for":[52,102,215],"its":[53],"practical":[54],"relevance.":[55],"A":[56],"shortcoming":[57],"Ball-Larus":[60,130,150,199],"technique":[61],"inability":[64],"profile":[66],"cyclic":[67,212],"paths,":[68,152],"making":[69],"it":[70],"difficult":[71],"mine":[73],"execution":[74],"patterns":[75],"that":[76,163,170,191],"span":[77],"multiple":[78],"loop":[79],"iterations.":[80,107],"Previous":[81],"results,":[82],"based":[83,120],"on":[84,121,125,179,186,204],"rather":[85],"complex":[86],"algorithms,":[87],"have":[88],"attempted":[89],"circumvent":[91],"this":[92,109,164],"limitation":[93],"at":[94],"price":[96],"significant":[98],"performance":[99],"losses":[100],"even":[101,196,214],"small":[104],"number":[105],"In":[108],"paper,":[110],"we":[111],"present":[112],"new":[114],"approach":[115,134,193],"multi-iteration":[117],"data":[122],"structures":[123],"built":[124],"top":[126],"original":[129],"numbering":[131],"technique.":[132],"Our":[133],"allows":[135],"profiling":[137,172],"all":[139],"executed":[140],"obtained":[142],"as":[143],"concatenation":[145],"up":[147],"k":[149,154],"acyclic":[151],"is":[155],"user-defined":[157],"parameter.":[158],"We":[159],"provide":[160],"examples":[161],"showing":[162],"method":[165],"reveal":[167],"optimization":[168],"opportunities":[169],"acyclic-path":[171],"would":[173],"miss.":[174],"An":[175],"extensive":[176],"experimental":[177],"investigation":[178],"large":[181,216],"variety":[182],"Java":[184],"benchmarks":[185],"Jikes":[188],"RVM":[189],"shows":[190],"our":[192],"be":[195],"faster":[197],"than":[198],"due":[200],"fewer":[202],"operations":[203],"smaller":[205],"hash":[206],"tables,":[207],"producing":[208],"compact":[209],"representations":[210],"values":[217],"k.":[219]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}