{"id":"https://openalex.org/W4391952003","doi":"https://doi.org/10.1145/3627535.3638487","title":"Language-Agnostic Static Deadlock Detection for Futures","display_name":"Language-Agnostic Static Deadlock Detection for Futures","publication_year":2024,"publication_date":"2024-02-20","ids":{"openalex":"https://openalex.org/W4391952003","doi":"https://doi.org/10.1145/3627535.3638487"},"language":"en","primary_location":{"id":"doi:10.1145/3627535.3638487","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3627535.3638487","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3627535.3638487","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3627535.3638487","any_repository_has_fulltext":true},"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, Chicago, Illinois, United States of America"],"affiliations":[{"raw_affiliation_string":"Illinois Institute of Technology, Chicago, Illinois, United States of America","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.4824,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.55024281,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"68","last_page":"79"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":1.0,"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":1.0,"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.9984999895095825,"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/T10715","display_name":"Distributed and Parallel Computing Systems","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.8393352031707764},{"id":"https://openalex.org/keywords/futures-contract","display_name":"Futures contract","score":0.8096319437026978},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.7606431841850281},{"id":"https://openalex.org/keywords/popularity","display_name":"Popularity","score":0.578718364238739},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.568837583065033},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5189076066017151},{"id":"https://openalex.org/keywords/dependency-graph","display_name":"Dependency graph","score":0.5036830306053162},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47557297348976135},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4627964496612549},{"id":"https://openalex.org/keywords/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.4477998614311218},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3856389820575714},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3818266987800598},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19710904359817505}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8393352031707764},{"id":"https://openalex.org/C106306483","wikidata":"https://www.wikidata.org/wiki/Q183984","display_name":"Futures contract","level":2,"score":0.8096319437026978},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.7606431841850281},{"id":"https://openalex.org/C2780586970","wikidata":"https://www.wikidata.org/wiki/Q1357284","display_name":"Popularity","level":2,"score":0.578718364238739},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.568837583065033},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5189076066017151},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.5036830306053162},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47557297348976135},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4627964496612549},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.4477998614311218},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3856389820575714},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3818266987800598},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19710904359817505},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3627535.3638487","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3627535.3638487","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3627535.3638487","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"},{"id":"doi:10.5281/zenodo.10223442","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.10223442","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3627535.3638487","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3627535.3638487","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3627535.3638487","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-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/G1467667629","display_name":"SHF: Small: Automatic Qualitative and Quantitative Verification of CUDA Code","funder_award_id":"2007784","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/G5921281487","display_name":null,"funder_award_id":"number","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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4391952003.pdf","grobid_xml":"https://content.openalex.org/works/W4391952003.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1977899806","https://openalex.org/W1983587324","https://openalex.org/W2044872254","https://openalex.org/W2072725684","https://openalex.org/W2072823661","https://openalex.org/W2099973379","https://openalex.org/W2115968584","https://openalex.org/W2118973181","https://openalex.org/W2132800423","https://openalex.org/W2154632906","https://openalex.org/W2156428492","https://openalex.org/W2294580796","https://openalex.org/W2763271584","https://openalex.org/W2914299639","https://openalex.org/W3007400938","https://openalex.org/W3019259517","https://openalex.org/W3120978113","https://openalex.org/W3122002490","https://openalex.org/W3132254651","https://openalex.org/W3149680153","https://openalex.org/W4205117926","https://openalex.org/W4251803824","https://openalex.org/W6892475642"],"related_works":["https://openalex.org/W2050076411","https://openalex.org/W1542183432","https://openalex.org/W2001478969","https://openalex.org/W2360686363","https://openalex.org/W1900787600","https://openalex.org/W2136552483","https://openalex.org/W2117224408","https://openalex.org/W2166954426","https://openalex.org/W3137070212","https://openalex.org/W2379911191"],"abstract_inverted_index":{"Deadlocks,":[0],"in":[1,8,37,40,59],"which":[2],"threads":[3],"wait":[4],"on":[5],"each":[6],"other":[7],"a":[9,86],"cyclic":[10],"fashion":[11],"and":[12,50,56],"can't":[13],"make":[14],"progress,":[15],"have":[16],"plagued":[17],"parallel":[18,27],"programs":[19,41,60],"for":[20],"decades.":[21],"In":[22],"recent":[23],"years,":[24],"as":[25,31,46,76,78],"the":[26,69,73],"programming":[28,88],"mechanism":[29],"known":[30],"futures":[32,43],"has":[33,44],"gained":[34],"popularity,":[35],"interest":[36],"preventing":[38],"deadlocks":[39],"with":[42,61],"increased":[45],"well.":[47],"Various":[48],"static":[49],"dynamic":[51],"algorithms":[52],"exist":[53],"to":[54,85],"detect":[55],"prevent":[57],"deadlock":[58],"futures,":[62],"generally":[63],"by":[64],"constructing":[65],"some":[66],"approximation":[67],"of":[68,72],"dependency":[70],"graph":[71],"program":[74],"but,":[75],"far":[77],"we":[79],"are":[80,83],"aware,":[81],"all":[82],"specialized":[84],"particular":[87],"language.":[89]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}