{"id":"https://openalex.org/W3004884024","doi":"https://doi.org/10.1145/381694.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/W3004884024","doi":"https://doi.org/10.1145/381694.378802","mag":"3004884024"},"language":"en","primary_location":{"id":"doi:10.1145/381694.378802","doi":"https://doi.org/10.1145/381694.378802","is_oa":false,"landing_page_url":"https://doi.org/10.1145/381694.378802","pdf_url":null,"source":{"id":"https://openalex.org/S148324379","display_name":"ACM SIGPLAN Notices","issn_l":"0362-1340","issn":["0362-1340","1558-1160"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGPLAN Notices","raw_type":"journal-article"},"volume":null,"type":"article","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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ecole Des Mines, Paris","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":1.1592,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.81328413,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":98},"biblio":{"volume":"36","issue":"5","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.9800000190734863,"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.9800000190734863,"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.007799999788403511,"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.0026000000070780516,"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.878000020980835},{"id":"https://openalex.org/keywords/demand-driven-analysis","display_name":"demand-driven analysis","score":0.9869999885559082},{"id":"https://openalex.org/keywords/points-to-analysis","display_name":"points-to analysis","score":0.9660000205039978},{"id":"https://openalex.org/keywords/flow-insensitive-analysis","display_name":"flow-insensitive analysis","score":0.8550000190734863},{"id":"https://openalex.org/keywords/call-graph-construction","display_name":"call graph construction","score":0.6340000033378601},{"id":"https://openalex.org/keywords/function-pointers","display_name":"function pointers","score":0.8999999761581421},{"id":"https://openalex.org/keywords/c-programs","display_name":"C programs","score":0.6769999861717224}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8678561449050903},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8516823053359985},{"id":"https://openalex.org/C7263679","wikidata":"https://www.wikidata.org/wiki/Q5978076","display_name":"Pointer analysis","level":3,"score":0.8185454607009888},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.8009019494056702},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.627397358417511},{"id":"https://openalex.org/C102379954","wikidata":"https://www.wikidata.org/wiki/Q2589940","display_name":"Call graph","level":2,"score":0.601685643196106},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.5615785717964172},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5162198543548584},{"id":"https://openalex.org/C106937863","wikidata":"https://www.wikidata.org/wiki/Q7236518","display_name":"Power graph analysis","level":3,"score":0.5024697780609131},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4997243881225586},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49887967109680176},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.4377216398715973},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3976752460002899},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3491295576095581},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3300381600856781},{"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/381694.378802","doi":"https://doi.org/10.1145/381694.378802","is_oa":false,"landing_page_url":"https://doi.org/10.1145/381694.378802","pdf_url":null,"source":{"id":"https://openalex.org/S148324379","display_name":"ACM SIGPLAN Notices","issn_l":"0362-1340","issn":["0362-1340","1558-1160"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGPLAN Notices","raw_type":"journal-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":12,"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"],"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/W7027541646","https://openalex.org/W2017785995","https://openalex.org/W3011557297","https://openalex.org/W7098682350","https://openalex.org/W3140151778"],"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,203,208,216,225],"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,202,223],"a":[17,27,36,45,163,184,220],"program":[18,20],"or":[19],"component.":[21],"In":[22],"this":[23],"paper":[24],"we":[25,34,79,180,195],"introduce":[26],"demand-driven":[28,37,77,119,209,217],"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,204,227],"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,197],"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,178,192,206],"analyses,":[78],"prove":[80],"algorithm":[83,210,218],"is":[84,92,145,170,211,219],"correct.":[85],"We":[86,106],"also":[87],"show":[88],"optimal":[93],"it":[98],"does":[99],"not":[100],"do":[101],"more":[102,182],"work":[103],"than":[104,183],"necessary.":[105],"illustrate":[107],"feasibility":[109],"efficiency":[111],"with":[115,129],"implementation":[117],"computing":[123,224],"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,189],"-":[141],"main":[143],"factor":[144],"how":[146],"much":[147],"graph":[151,169],"must":[152],"be":[153],"computed":[154],"call-graph.":[158],"For":[159,187],"some":[160],"benchmarks,":[161],"only":[162],"small":[164],"part":[165],"needed":[171],"(e.g":[172],"pouray":[173],"emacs":[174],"gcc":[176],"),":[177,194],"here":[179,207],"see":[181],"10x":[185],"speedup.":[186],"other":[188],"(e.g.":[190],"burlap":[191],"gimp":[193],"need":[196],"compute":[198],"most":[199],"(>":[200],"95%)":[201],"graph,":[205],"considerably":[212],"slower,":[213],"because":[214],"using":[215],"slow":[221],"method":[222],"full":[226],"graph.":[228]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-09-21T07:43:02.447757","created_date":"2020-02-14T00:00:00"}