{"id":"https://openalex.org/W2096862145","doi":"https://doi.org/10.1145/2254064.2254124","title":"Logical inference techniques for loop parallelization","display_name":"Logical inference techniques for loop parallelization","publication_year":2012,"publication_date":"2012-06-11","ids":{"openalex":"https://openalex.org/W2096862145","doi":"https://doi.org/10.1145/2254064.2254124","mag":"2096862145"},"language":"en","primary_location":{"id":"doi:10.1145/2254064.2254124","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2254064.2254124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation","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/A5080735312","display_name":"Cosmin E. Oancea","orcid":"https://orcid.org/0000-0001-5421-6876"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Cosmin E. Oancea","raw_affiliation_strings":["University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056736926","display_name":"Lawrence Rauchwerger","orcid":"https://orcid.org/0000-0002-1545-4991"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lawrence Rauchwerger","raw_affiliation_strings":["Texas A&M University, College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.2724,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.95930916,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"509","last_page":"520"},"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.9994999766349792,"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.9994999766349792,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9980999827384949,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7618995904922485},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6613346338272095},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.6403380632400513},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.5592345595359802},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5513479709625244},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3695839047431946},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3286352753639221},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1380603015422821},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1348854899406433}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7618995904922485},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6613346338272095},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.6403380632400513},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.5592345595359802},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5513479709625244},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3695839047431946},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3286352753639221},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1380603015422821},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1348854899406433},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/2254064.2254124","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2254064.2254124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.433.3100","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.433.3100","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://parasol.tamu.edu/publications/download.php?file_id=781","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.724.9071","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.724.9071","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.diku.dk/%7Ezgh600/Publications/pldi102-oancea.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/c4adcb05-2d72-4c5b-b20c-3b9949d6a1b6","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/c4adcb05-2d72-4c5b-b20c-3b9949d6a1b6","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Oancea , C E & Rauchwerger , L 2012 , Logical inference techniques for loop parallelization . in Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation . Association for Computing Machinery , pp. 509-520 , 33rd ACM SIGPLAN conference on Programming Language Design and Implementation , Beijing , China , 11/06/2012 . https://doi.org/10.1145/2254064.2254124","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:repository.kaust.edu.sa:10754/598227","is_oa":false,"landing_page_url":"http://hdl.handle.net/10754/598227","pdf_url":null,"source":{"id":"https://openalex.org/S4306401596","display_name":"King Abdullah University of Science and Technology Repository (King Abdullah University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I71920554","host_organization_name":"King Abdullah University of Science and Technology","host_organization_lineage":["https://openalex.org/I71920554"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W16598917","https://openalex.org/W58073954","https://openalex.org/W1494930385","https://openalex.org/W1500117749","https://openalex.org/W1532095066","https://openalex.org/W1534865885","https://openalex.org/W1556941704","https://openalex.org/W1560642162","https://openalex.org/W1949424081","https://openalex.org/W1966848517","https://openalex.org/W1980390491","https://openalex.org/W1980999196","https://openalex.org/W1984303163","https://openalex.org/W1988777345","https://openalex.org/W1998857607","https://openalex.org/W2032391783","https://openalex.org/W2034591560","https://openalex.org/W2091722458","https://openalex.org/W2097699872","https://openalex.org/W2111365507","https://openalex.org/W2123123602","https://openalex.org/W2148255965","https://openalex.org/W2148597203","https://openalex.org/W2153913439","https://openalex.org/W2154523940","https://openalex.org/W2156680804","https://openalex.org/W2157099283","https://openalex.org/W2158958889","https://openalex.org/W2163618556","https://openalex.org/W2181793781","https://openalex.org/W2340604309","https://openalex.org/W2543333295","https://openalex.org/W4231316372"],"related_works":["https://openalex.org/W24774503","https://openalex.org/W2014821076","https://openalex.org/W1990620319","https://openalex.org/W1965744717","https://openalex.org/W2111234595","https://openalex.org/W2055243143","https://openalex.org/W3216334292","https://openalex.org/W1883238101","https://openalex.org/W2481821631","https://openalex.org/W1536525683"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,79,86,97,105,115,142,155],"fully":[4],"automatic":[5],"approach":[6,194],"to":[7,124],"loop":[8],"parallelization":[9,42,137],"that":[10,147,161,192],"integrates":[11],"the":[12,41,46,49,61,69,120,149,210],"use":[13],"of":[14,48,89,100,129,157,173],"static":[15],"and":[16,19,28,32,67,187,190,202,212],"run-time":[17],"analysis":[18,38],"thus":[20],"overcomes":[21],"many":[22],"known":[23],"difficulties":[24],"such":[25],"as":[26,72],"nonlinear":[27],"indirect":[29],"array":[30,58,83],"indexing":[31],"complex":[33,151,200],"control":[34],"flow.":[35],"Our":[36],"hybrid":[37],"framework":[39],"validates":[40],"transformation":[43],"by":[44],"verifying":[45],"independence":[47,70,159],"loop's":[50],"memory":[51],"references.":[52],"To":[53,109],"this":[54,111],"end":[55],"it":[56],"represents":[57],"references":[59],"using":[60,141],"USR":[62,121],"(uniform":[63],"set":[64,80],"representation)":[65],"language":[66,87,116,123,128],"expresses":[68],"condition":[71],"an":[73,90,125],"equation,":[74],"S=0,":[75],"where":[76],"S":[77,94,133],"is":[78,138,195],"expression":[81],"representing":[82],"indexes.":[84],"Using":[85],"instead":[88],"array-abstraction":[91],"representation":[92],"for":[93],"results":[95],"in":[96,170,197],"smaller":[98],"number":[99],"conservative":[101],"approximations":[102],"but":[103],"exhibits":[104],"potentially-high":[106],"runtime":[107],"cost.":[108],"alleviate":[110],"cost":[112],"we":[113],"introduce":[114],"translation":[117],"F":[118],"from":[119,185],"set-expression":[122],"equally":[126],"rich":[127],"predicates":[130,152],"(F(S)":[131],"==>":[132],"=":[134],"0).":[135],"Loop":[136],"then":[139],"validated":[140],"novel":[143],"logic":[144],"inference":[145],"algorithm":[146],"factorizes":[148],"obtained":[150],"(F(S))":[153],"into":[154],"sequence":[156],"sufficient":[158],"conditions":[160],"are":[162],"evaluated":[163],"first":[164],"statically":[165],"and,":[166],"when":[167],"needed,":[168],"dynamically,":[169],"increasing":[171],"order":[172],"their":[174],"estimated":[175],"complexities.":[176],"We":[177],"evaluate":[178],"our":[179,193],"automated":[180],"solution":[181],"on":[182],"26":[183],"benchmarks":[184],"PERFECT-Club":[186],"SPEC":[188],"suites":[189],"show":[191],"effective":[196],"parallelizing":[198],"large,":[199],"loops":[201],"obtains":[203],"much":[204],"better":[205],"full":[206],"program":[207],"speedups":[208],"than":[209],"Intel":[211],"IBM":[213],"Fortran":[214],"compilers.":[215]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}