{"id":"https://openalex.org/W3041508673","doi":"https://doi.org/10.1145/3434315","title":"The fine-grained and parallel complexity of andersen\u2019s pointer analysis","display_name":"The fine-grained and parallel complexity of andersen\u2019s pointer analysis","publication_year":2021,"publication_date":"2021-01-04","ids":{"openalex":"https://openalex.org/W3041508673","doi":"https://doi.org/10.1145/3434315","mag":"3041508673"},"language":"en","primary_location":{"id":"doi:10.1145/3434315","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3434315","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3434315","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3434315","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5116039174","display_name":"Anders Alnor Mathiasen","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Anders Alnor Mathiasen","raw_affiliation_strings":["Aarhus University, Denmark","Aarhus university;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Aarhus university;","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022252401","display_name":"Andreas Pavlogiannis","orcid":"https://orcid.org/0000-0002-8943-0722"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Andreas Pavlogiannis","raw_affiliation_strings":["Aarhus University, Denmark","Aarhus university;"],"raw_orcid":"https://orcid.org/0000-0002-8943-0722","affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Aarhus university;","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1399,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.51373327,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"5","issue":"POPL","first_page":"1","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9987999796867371,"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/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/T11241","display_name":"Advanced Malware Detection Techniques","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/pointer","display_name":"Pointer (user interface)","score":0.8315858840942383},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.6921965479850769},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6639964580535889},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.618815541267395},{"id":"https://openalex.org/keywords/pointer-analysis","display_name":"Pointer analysis","score":0.586923360824585},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.46538013219833374},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.42529380321502686},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.4115542471408844},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3946918547153473},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38641971349716187},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3333699107170105},{"id":"https://openalex.org/keywords/static-analysis","display_name":"Static analysis","score":0.17808878421783447},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.12453341484069824}],"concepts":[{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.8315858840942383},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.6921965479850769},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6639964580535889},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.618815541267395},{"id":"https://openalex.org/C7263679","wikidata":"https://www.wikidata.org/wiki/Q5978076","display_name":"Pointer analysis","level":3,"score":0.586923360824585},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.46538013219833374},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.42529380321502686},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.4115542471408844},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3946918547153473},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38641971349716187},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3333699107170105},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.17808878421783447},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.12453341484069824},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/3434315","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3434315","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3434315","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire/d038a3af-f963-411c-b3b1-442185a6f124","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/d038a3af-f963-411c-b3b1-442185a6f124","pdf_url":"https://pure.au.dk/ws/files/285315268/3434315.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Mathiasen, A A & Pavlogiannis, A 2021, 'The Fine-Grained and Parallel Complexity of Andersen\u2019s Pointer Analysis', Proceedings of the ACM on Programming Languages , vol. 5, no. POPL, 34. https://doi.org/10.1145/3434315","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:2006.01491","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2006.01491","pdf_url":"https://arxiv.org/pdf/2006.01491","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:3041508673","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2006.01491.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.2006.01491","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2006.01491","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3434315","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3434315","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3434315","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":[{"id":"https://metadata.un.org/sdg/10","score":0.6800000071525574,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3041508673.pdf","grobid_xml":"https://content.openalex.org/works/W3041508673.grobid-xml"},"referenced_works_count":65,"referenced_works":["https://openalex.org/W186778975","https://openalex.org/W1507046749","https://openalex.org/W1837958857","https://openalex.org/W1966032455","https://openalex.org/W1971782746","https://openalex.org/W1975173527","https://openalex.org/W1990053053","https://openalex.org/W1995169979","https://openalex.org/W1997343231","https://openalex.org/W2004916460","https://openalex.org/W2009911326","https://openalex.org/W2017842497","https://openalex.org/W2025514726","https://openalex.org/W2031507118","https://openalex.org/W2035476608","https://openalex.org/W2044735058","https://openalex.org/W2046699259","https://openalex.org/W2055084740","https://openalex.org/W2055545029","https://openalex.org/W2064292174","https://openalex.org/W2064982280","https://openalex.org/W2069476565","https://openalex.org/W2075309900","https://openalex.org/W2084732238","https://openalex.org/W2084816051","https://openalex.org/W2087567537","https://openalex.org/W2089522440","https://openalex.org/W2094090625","https://openalex.org/W2098009775","https://openalex.org/W2108827729","https://openalex.org/W2110833886","https://openalex.org/W2113766267","https://openalex.org/W2119137801","https://openalex.org/W2120248756","https://openalex.org/W2131135493","https://openalex.org/W2134569009","https://openalex.org/W2135565307","https://openalex.org/W2140232587","https://openalex.org/W2144367957","https://openalex.org/W2146507303","https://openalex.org/W2149237601","https://openalex.org/W2153578567","https://openalex.org/W2157103506","https://openalex.org/W2162405266","https://openalex.org/W2165354374","https://openalex.org/W2491245257","https://openalex.org/W2547862110","https://openalex.org/W2604520577","https://openalex.org/W2618199688","https://openalex.org/W2786655984","https://openalex.org/W2892948282","https://openalex.org/W2914775339","https://openalex.org/W2920740222","https://openalex.org/W2999411576","https://openalex.org/W3000452330","https://openalex.org/W3005402394","https://openalex.org/W3018596786","https://openalex.org/W3027560063","https://openalex.org/W3041614022","https://openalex.org/W3045684483","https://openalex.org/W3130008218","https://openalex.org/W3153131947","https://openalex.org/W4206770190","https://openalex.org/W4234849644","https://openalex.org/W4255499266"],"related_works":["https://openalex.org/W3033723969","https://openalex.org/W2136083928","https://openalex.org/W3127794364","https://openalex.org/W3100460727","https://openalex.org/W2964920388","https://openalex.org/W3041614022","https://openalex.org/W286834056","https://openalex.org/W2011047736","https://openalex.org/W2992150660","https://openalex.org/W2400994770","https://openalex.org/W2114607430","https://openalex.org/W2031137635","https://openalex.org/W2960841636","https://openalex.org/W2294255905","https://openalex.org/W2792794671","https://openalex.org/W2465024128","https://openalex.org/W2950786443","https://openalex.org/W2949195484","https://openalex.org/W2283590027","https://openalex.org/W2801961161"],"abstract_inverted_index":{"Pointer":[0,42],"analysis":[1],"is":[2,19,40,61,67,113,251,261,271,276,317,341,354],"one":[3],"of":[4,15,25,50,57,144,163,239,328],"the":[5,17,26,75,97,142,145,235,272,298,326,339,352,369],"fundamental":[6],"problems":[7],"in":[8,74,82,121,135,263,282,337,368],"static":[9],"program":[10],"analysis.":[11],"Given":[12],"a":[13,22,55,68,105,156,208,211,214],"set":[14,49,56],"pointers,":[16],"task":[18],"to":[20,70,213,365],"produce":[21],"useful":[23],"over-approximation":[24],"memory":[27],"locations":[28],"that":[29,96,116,132,203,243,256,278,292,362],"each":[30],"pointer":[31,52,210],"may":[32],"point-to":[33],"at":[34],"runtime.":[35],"The":[36],"most":[37],"common":[38],"formulation":[39],"Andersen\u2019s":[41],"Analysis":[43],"(APA),":[44],"defined":[45],"as":[46,64,193],"an":[47,174,220,302],"inclusion-based":[48],"m":[51,88,191,198],"constraints":[53],"over":[54,185],"n":[58,85,124,177,188,194,222,247,265,304],"pointers.":[59],"Scalability":[60],"extremely":[62],"important,":[63],"points-to":[65],"information":[66],"prerequisite":[69],"many":[71],"other":[72],"components":[73],"static-analysis":[76],"pipeline.":[77],"Existing":[78],"algorithms":[79],"solve":[80],"APA":[81,117,206,260,329],"O":[83,122,175,186,196,245],"(":[84,123,176,187,197,246],"2":[86,125,189,305],"\u00b7":[87,190],")":[89,126,179,192,224,267,306],"time,":[90,268],"while":[91],"it":[92],"has":[93,99,147,219,301],"been":[94],"conjectured":[95],"problem":[98,146,300,340,353],"no":[100],"truly":[101],"sub-cubic":[102],"algorithm,":[103],"with":[104],"proof":[106],"so":[107],"far":[108],"having":[109],"remained":[110,148],"elusive.":[111],"It":[112,275],"also":[114],"well-known":[115],"can":[118,363],"be":[119],"solved":[120],"time":[127],"under":[128,228,257,294,309,349],"certain":[129],"sparsity":[130],"conditions":[131],"hold":[133],"naturally":[134],"some":[136],"settings.":[137],"Besides":[138],"these":[139],"simple":[140],"bounds,":[141],"complexity":[143,161],"poorly":[149],"understood.":[150],"In":[151],"this":[152,285],"work":[153],"we":[154,172,201,254,290,324],"draw":[155],"rich":[157],"fine-grained":[158],"and":[159,165,168,241,313,330,333,343],"parallel":[160],"landscape":[162],"APA,":[164,183,240],"present":[166],"upper":[167,334],"lower":[169,226,307,332],"bounds.":[170],"First,":[171],"establish":[173,331],"3":[178,223,248],"upper-bound":[180],"for":[181],"general":[182],"improving":[184],"=":[195],").":[199],"Second,":[200],"show":[202,255,291],"even":[204,293,297],"on-demand":[205,299],"(\u201cmay":[207],"specific":[209,215],"point":[212],"location":[216],"b":[217],"?\u201d)":[218],"\u03a9(":[221,303],"(combinatorial)":[225],"bound":[227,286,308],"standard":[229,310],"complexity-theoretic":[230,311],"hypotheses.":[231],"This":[232],"formally":[233],"establishes":[234],"long-conjectured":[236],"\u201ccubic":[237],"bottleneck\u201d":[238],"shows":[242],"our":[244,315],")-time":[249],"algorithm":[250,316],"optimal.":[252],"Third,":[253],"mild":[258,350],"restrictions,":[259,296,351],"solvable":[262],"\u00d5(":[264],"\u03c9":[266],"where":[269],"\u03c9<2.373":[270],"matrix-multiplication":[273],"exponent.":[274],"believed":[277],"\u03c9=2+":[279,320],"o":[280,321],"(1),":[281],"which":[283],"case":[284],"becomes":[287],"quadratic.":[288],"Fourth,":[289],"such":[295],"hypotheses,":[312],"hence":[314,344],"optimal":[318],"when":[319],"(1).":[322],"Fifth,":[323],"study":[325],"parallelizability":[327],"bounds:":[335],"(i)":[336],"general,":[338],"P-complete":[342],"unlikely":[345],"parallelizable,":[346],"whereas":[347],"(ii)":[348],"parallelizable.":[355],"Our":[356],"theoretical":[357],"treatment":[358],"formalizes":[359],"several":[360],"insights":[361],"lead":[364],"practical":[366],"improvements":[367],"future.":[370]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}