{"id":"https://openalex.org/W4205117926","doi":"https://doi.org/10.1145/3498708","title":"Static prediction of parallel computation graphs","display_name":"Static prediction of parallel computation graphs","publication_year":2022,"publication_date":"2022-01-12","ids":{"openalex":"https://openalex.org/W4205117926","doi":"https://doi.org/10.1145/3498708"},"language":"en","primary_location":{"id":"doi:10.1145/3498708","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3498708","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3498708","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3498708","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009393339","display_name":"Stefan K. Muller","orcid":"https://orcid.org/0000-0002-3210-9727"},"institutions":[{"id":"https://openalex.org/I180949307","display_name":"Illinois Institute of Technology","ror":"https://ror.org/037t3ry66","country_code":"US","type":"education","lineage":["https://openalex.org/I180949307"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Stefan K. Muller","raw_affiliation_strings":["Illinois Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Illinois Institute of Technology, USA","institution_ids":["https://openalex.org/I180949307"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5009393339"],"corresponding_institution_ids":["https://openalex.org/I180949307"],"apc_list":null,"apc_paid":null,"fwci":0.7002,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.6449991,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"6","issue":"POPL","first_page":"1","last_page":"31"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9958999752998352,"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"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.994700014591217,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8116305470466614},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5592945218086243},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.55695641040802},{"id":"https://openalex.org/keywords/dependency-graph","display_name":"Dependency graph","score":0.5455479621887207},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5324434041976929},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5008103847503662},{"id":"https://openalex.org/keywords/wait-for-graph","display_name":"Wait-for graph","score":0.4596973657608032},{"id":"https://openalex.org/keywords/type-inference","display_name":"Type inference","score":0.4571424126625061},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.4548521637916565},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45163071155548096},{"id":"https://openalex.org/keywords/graph-rewriting","display_name":"Graph rewriting","score":0.36161482334136963},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.32979992032051086}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8116305470466614},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5592945218086243},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.55695641040802},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.5455479621887207},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5324434041976929},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5008103847503662},{"id":"https://openalex.org/C106891557","wikidata":"https://www.wikidata.org/wiki/Q4148051","display_name":"Wait-for graph","level":4,"score":0.4596973657608032},{"id":"https://openalex.org/C198370458","wikidata":"https://www.wikidata.org/wiki/Q586459","display_name":"Type inference","level":3,"score":0.4571424126625061},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.4548521637916565},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45163071155548096},{"id":"https://openalex.org/C558772884","wikidata":"https://www.wikidata.org/wiki/Q1508564","display_name":"Graph rewriting","level":3,"score":0.36161482334136963},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.32979992032051086},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3498708","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3498708","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3498708","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3498708","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3498708","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3498708","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1465477919","display_name":null,"funder_award_id":"CCF-2107289","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4704430651","display_name":"Collaborative Research: SHF: Medium: Responsive Parallelism for Interactive Applications: Theory and Practice","funder_award_id":"2107289","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4205117926.pdf","grobid_xml":"https://content.openalex.org/works/W4205117926.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W95201508","https://openalex.org/W912214939","https://openalex.org/W1525599808","https://openalex.org/W1535699984","https://openalex.org/W1593182640","https://openalex.org/W1980948348","https://openalex.org/W1983587324","https://openalex.org/W1997897465","https://openalex.org/W2001673593","https://openalex.org/W2006638707","https://openalex.org/W2013433526","https://openalex.org/W2024929322","https://openalex.org/W2025188594","https://openalex.org/W2031144446","https://openalex.org/W2048921878","https://openalex.org/W2051600983","https://openalex.org/W2056714230","https://openalex.org/W2068055184","https://openalex.org/W2087875803","https://openalex.org/W2104824528","https://openalex.org/W2108202121","https://openalex.org/W2122937771","https://openalex.org/W2144249474","https://openalex.org/W2154632906","https://openalex.org/W2156428492","https://openalex.org/W2166822586","https://openalex.org/W2167744164","https://openalex.org/W2171628704","https://openalex.org/W2293624369","https://openalex.org/W2470978318","https://openalex.org/W2763271584","https://openalex.org/W2906726523","https://openalex.org/W2913263777","https://openalex.org/W2914299639","https://openalex.org/W2998338832","https://openalex.org/W3007400938","https://openalex.org/W3033203490","https://openalex.org/W3099303552","https://openalex.org/W3137220996","https://openalex.org/W4251803824"],"related_works":["https://openalex.org/W2981707591","https://openalex.org/W2116294757","https://openalex.org/W2134218604","https://openalex.org/W1550302283","https://openalex.org/W3001814250","https://openalex.org/W2162002675","https://openalex.org/W2185595643","https://openalex.org/W3038081141","https://openalex.org/W1579200824","https://openalex.org/W1503109353"],"abstract_inverted_index":{"Many":[0],"algorithms":[1],"for":[2,6,89,180],"analyzing":[3],"parallel":[4,39,48,117],"programs,":[5,49],"example":[7],"to":[8,15,167],"detect":[9],"deadlocks":[10],"or":[11,14,33,77],"data":[12],"races":[13],"calculate":[16],"the":[17,38,59,103,146,169],"execution":[18,63],"cost,":[19],"are":[20,52,73,78,113],"based":[21],"on":[22,58,131],"a":[23,28,44,84,90,116,120,150],"model":[24],"variously":[25],"known":[26],"as":[27],"cost":[29,184],"graph,":[30,35],"computation":[31,50],"graph":[32,96,121,162],"dependency":[34,87],"which":[36,98,127],"captures":[37],"structure":[40],"of":[41,86,102,152,171],"threads":[42],"in":[43],"program.":[45],"In":[46],"modern":[47],"graphs":[51,72,104],"highly":[53],"dynamic":[54,75],"and":[55,62,124,139,158,183],"depend":[56],"greatly":[57],"program":[60,109,118],"inputs":[61],"details.":[64],"As":[65],"such,":[66],"most":[67],"analyses":[68,76,81,175,179],"that":[69,82,105],"use":[70],"these":[71],"either":[74],"specialized":[79],"static":[80,174],"gather":[83],"subset":[85,151],"information":[88],"specific":[91],"purpose.":[92],"This":[93],"paper":[94],"introduces":[95],"types,":[97],"compactly":[99],"represent":[100],"all":[101],"could":[106],"arise":[107],"from":[108,115,133],"execution.":[110],"Graph":[111],"types":[112,163],"inferred":[114],"using":[119],"type":[122,135,141],"system":[123],"inference":[125,147],"algorithm,":[126],"we":[128,159],"present":[129],"drawing":[130],"ideas":[132],"Hindley-Milner":[134],"inference,":[136],"affine":[137],"logic":[138],"region":[140],"systems.":[142],"We":[143],"have":[144],"implemented":[145],"algorithm":[148],"over":[149],"OCaml,":[153],"extended":[154],"with":[155],"parallelism":[156],"primitives,":[157],"demonstrate":[160],"how":[161],"can":[164],"be":[165],"used":[166],"accelerate":[168],"development":[170],"new":[172],"graph-based":[173],"by":[176],"presenting":[177],"proof-of-concept":[178],"deadlock":[181],"detection":[182],"analysis.":[185]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}