{"id":"https://openalex.org/W2017842497","doi":"https://doi.org/10.1145/378795.378802","title":"Demand-driven pointer analysis","display_name":"Demand-driven pointer analysis","publication_year":2001,"publication_date":"2001-05-01","ids":{"openalex":"https://openalex.org/W2017842497","doi":"https://doi.org/10.1145/378795.378802","mag":"2017842497"},"language":"en","primary_location":{"id":"doi:10.1145/378795.378802","doi":"https://doi.org/10.1145/378795.378802","is_oa":false,"landing_page_url":"https://doi.org/10.1145/378795.378802","pdf_url":null,"source":{"id":"https://openalex.org/S4393917474","display_name":"ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)","issn_l":"1531-7102","issn":["1531-7102"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5027118573","display_name":"Nevin Heintze","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4387152956","display_name":"Alcatel-Lucent (France)","ror":"https://ror.org/024850w61","country_code":"FR","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I4210149358","https://openalex.org/I4387152956"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nevin Heintze","raw_affiliation_strings":["Research, A gere Systems, Lucent Technologies, Microelectronics Division"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research, A gere Systems, Lucent Technologies, Microelectronics Division","institution_ids":["https://openalex.org/I4387152956"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086114919","display_name":"Olivier Tardieu","orcid":"https://orcid.org/0000-0002-8377-6757","observed_orcids":["https://orcid.org/0000-0002-8377-6757"]},"institutions":[{"id":"https://openalex.org/I70768539","display_name":"\u00c9cole Nationale Sup\u00e9rieure des Mines de Paris","ror":"https://ror.org/04y8cs423","country_code":"FR","type":"education","lineage":["https://openalex.org/I190752583","https://openalex.org/I2746051580","https://openalex.org/I70768539"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Olivier Tardieu","raw_affiliation_strings":["Ecole Des Mines, Paris","Ecole des Mines, Paris#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ecole Des Mines, Paris","institution_ids":["https://openalex.org/I70768539"]},{"raw_affiliation_string":"Ecole des Mines, Paris#TAB#","institution_ids":["https://openalex.org/I70768539"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.3448,"has_fulltext":false,"cited_by_count":154,"citation_normalized_percentile":{"value":0.95232877,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"24","last_page":"34"},"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.9740999937057495,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9740999937057495,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.010599999688565731,"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/T11424","display_name":"Security and Verification in Computing","score":0.0031999999191612005,"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/pointer-analysis","display_name":"pointer analysis","score":0.8389999866485596},{"id":"https://openalex.org/keywords/demand-driven-analysis","display_name":"demand-driven analysis","score":0.9900000095367432},{"id":"https://openalex.org/keywords/points-to-analysis","display_name":"points-to analysis","score":0.9629999995231628},{"id":"https://openalex.org/keywords/flow-insensitive-analysis","display_name":"flow-insensitive analysis","score":0.8450000286102295},{"id":"https://openalex.org/keywords/call-graph-construction","display_name":"call graph construction","score":0.6940000057220459},{"id":"https://openalex.org/keywords/function-pointers","display_name":"function pointers","score":0.9150000214576721},{"id":"https://openalex.org/keywords/c-programs","display_name":"C programs","score":0.7210000157356262}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8413726687431335},{"id":"https://openalex.org/C7263679","wikidata":"https://www.wikidata.org/wiki/Q5978076","display_name":"Pointer analysis","level":3,"score":0.8390970230102539},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.8234782218933105},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.797469973564148},{"id":"https://openalex.org/C102379954","wikidata":"https://www.wikidata.org/wiki/Q2589940","display_name":"Call graph","level":2,"score":0.6072388291358948},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6055477857589722},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.5588361024856567},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5407083630561829},{"id":"https://openalex.org/C106937863","wikidata":"https://www.wikidata.org/wiki/Q7236518","display_name":"Power graph analysis","level":3,"score":0.5379825830459595},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4984302520751953},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.492395281791687},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.3966173827648163},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39165133237838745},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3583011031150818},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.29271018505096436},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/378795.378802","doi":"https://doi.org/10.1145/378795.378802","is_oa":false,"landing_page_url":"https://doi.org/10.1145/378795.378802","pdf_url":null,"source":{"id":"https://openalex.org/S4393917474","display_name":"ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)","issn_l":"1531-7102","issn":["1531-7102"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W2009911326","https://openalex.org/W2022363576","https://openalex.org/W2065088439","https://openalex.org/W2069476565","https://openalex.org/W2077102566","https://openalex.org/W2084816051","https://openalex.org/W2095115578","https://openalex.org/W2096587139","https://openalex.org/W2102440514","https://openalex.org/W2131135493","https://openalex.org/W2149237601","https://openalex.org/W2151360539","https://openalex.org/W2156549049"],"related_works":["https://openalex.org/W7104442255","https://openalex.org/W7098997462","https://openalex.org/W3003995678","https://openalex.org/W3217653032","https://openalex.org/W2553375745","https://openalex.org/W2017785995","https://openalex.org/W7027541646","https://openalex.org/W3011557297","https://openalex.org/W3140151778","https://openalex.org/W2891057055"],"abstract_inverted_index":{"Known":[0],"algorithms":[1],"for":[2,30,63,122],"pointer":[3,31,48],"analysis":[4,15,53,91,114,121],"are":[5],"\u201cglobal\u201d":[6],"in":[7,94],"the":[8,60,73,76,95,108,124,142,149,157,167,201,206,214,223],"sense":[9,96],"that":[10,81,89,97],"they":[11],"perform":[12],"an":[13,116],"exhaustive":[14,74],"of":[16,47,71,112,118,126,134,148,166,200,221],"a":[17,27,36,45,163,183,218],"program":[18,20],"or":[19],"component.":[21],"In":[22],"this":[23],"paper":[24],"we":[25,34,79,179,193],"introduce":[26],"demand-driven":[28,37,77,119,207,215],"approach":[29],"analysis.":[32,43],"Specifically,":[33],"describe":[35],"flow-insensitive,":[38],"subset-based,":[39],"con":[40],"text-insensitive":[41],"points-to":[42,61,120,150,168,202,225],"Given":[44],"list":[46],"variables":[49],"(a":[50],"query),":[51],"our":[52,82,90,113,135],"performs":[54],"just":[55],"enough":[56],"computation":[57],"to":[58,155,195],"determine":[59,156],"sets":[62],"these":[64],"query":[65],"variables.":[66],"Using":[67],"deductive":[68],"reachability":[69],"formulations":[70],"both":[72],"and":[75,110,175,177,191,204],"analyses,":[78],"prove":[80],"algorithm":[83,208,216],"is":[84,92,145,170,209,217],"correct.":[85],"We":[86,106],"also":[87],"show":[88],"optimal":[93],"it":[98],"does":[99],"not":[100],"do":[101],"more":[102,181],"work":[103],"than":[104,182],"necessary.":[105],"illustrate":[107],"feasibility":[109],"efficiency":[111],"with":[115,129],"implementation":[117],"computing":[123,222],"call-graphs":[125],"C":[127],"programs":[128],"function":[130],"pointers.":[131],"The":[132],"performance":[133],"system":[136],"varies":[137],"substantially":[138],"across":[139],"benchmarks":[140,188],"-":[141],"main":[143],"factor":[144],"how":[146],"much":[147],"graph":[151,169],"must":[152],"be":[153],"computed":[154],"call-graph.":[158],"For":[159,186],"some":[160],"benchmarks,":[161],"only":[162],"small":[164],"part":[165],"needed":[171],"(e.g":[172],"pouray":[173],"emacs":[174],"gcc),":[176],"here":[178,205],"see":[180],"10x":[184],"speedup.":[185],"other":[187],"(e.g.":[189],"burlap":[190],"gimp),":[192],"need":[194],"compute":[196],"most":[197],"(>":[198],"95%)":[199],"graph,":[203],"considerably":[210],"slower,":[211],"because":[212],"using":[213],"slow":[219],"method":[220],"full":[224],"graph.":[226]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":6}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}