{"id":"https://openalex.org/W2070834697","doi":"https://doi.org/10.1145/2602988.2602989","title":"Push-pull constraint graph for efficient points-to analysis","display_name":"Push-pull constraint graph for efficient points-to analysis","publication_year":2014,"publication_date":"2014-06-10","ids":{"openalex":"https://openalex.org/W2070834697","doi":"https://doi.org/10.1145/2602988.2602989","mag":"2070834697"},"language":"en","primary_location":{"id":"doi:10.1145/2602988.2602989","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2602988.2602989","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 international symposium on Memory management","raw_type":"proceedings-article"},"type":"article","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/A5070379798","display_name":"Bollu Ratnakar","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Bollu Ratnakar","raw_affiliation_strings":["IIT Madras, Chennai, India"],"affiliations":[{"raw_affiliation_string":"IIT Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018046405","display_name":"Rupesh Nasre","orcid":"https://orcid.org/0000-0001-7490-625X"},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Rupesh Nasre.","raw_affiliation_strings":["IIT Madras, Chennai, India"],"affiliations":[{"raw_affiliation_string":"IIT Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5070379798"],"corresponding_institution_ids":["https://openalex.org/I24676775"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12834841,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"25","last_page":"33"},"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.9987999796867371,"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.9987999796867371,"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/T11424","display_name":"Security and Verification in Computing","score":0.9966999888420105,"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.996399998664856,"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.7656059861183167},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.6470521688461304},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5773415565490723},{"id":"https://openalex.org/keywords/call-graph","display_name":"Call graph","score":0.5555227994918823},{"id":"https://openalex.org/keywords/pointer","display_name":"Pointer (user interface)","score":0.5460701584815979},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5420364737510681},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.509739339351654},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4665507972240448},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.43918588757514954},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.41880881786346436},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30756616592407227},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14040765166282654},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.13996827602386475},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11630091071128845}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7656059861183167},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.6470521688461304},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5773415565490723},{"id":"https://openalex.org/C102379954","wikidata":"https://www.wikidata.org/wiki/Q2589940","display_name":"Call graph","level":2,"score":0.5555227994918823},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.5460701584815979},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5420364737510681},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.509739339351654},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4665507972240448},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.43918588757514954},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.41880881786346436},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30756616592407227},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14040765166282654},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.13996827602386475},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11630091071128845},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2602988.2602989","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2602988.2602989","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 international symposium on Memory management","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.75}],"awards":[{"id":"https://openalex.org/G2222689452","display_name":null,"funder_award_id":"CSE/13-14/812/NFIG/RUPS","funder_id":"https://openalex.org/F4320322211","funder_display_name":"Indian Institute of Technology Madras"}],"funders":[{"id":"https://openalex.org/F4320322211","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1536098516","https://openalex.org/W1536257526","https://openalex.org/W1543471126","https://openalex.org/W1776086112","https://openalex.org/W1965604953","https://openalex.org/W2013570118","https://openalex.org/W2044735058","https://openalex.org/W2048229966","https://openalex.org/W2065088439","https://openalex.org/W2069476565","https://openalex.org/W2084109819","https://openalex.org/W2086039932","https://openalex.org/W2095115578","https://openalex.org/W2096209431","https://openalex.org/W2096587139","https://openalex.org/W2117948828","https://openalex.org/W2131135493","https://openalex.org/W2134569009","https://openalex.org/W2141442517","https://openalex.org/W2145911832","https://openalex.org/W2149237601","https://openalex.org/W2153185479","https://openalex.org/W2153578567","https://openalex.org/W2157103506","https://openalex.org/W2158600037","https://openalex.org/W3005914750","https://openalex.org/W4245921527"],"related_works":["https://openalex.org/W2296034340","https://openalex.org/W4233102183","https://openalex.org/W2023722467","https://openalex.org/W2120308515","https://openalex.org/W2109005061","https://openalex.org/W2152043747","https://openalex.org/W2729473725","https://openalex.org/W2038036666","https://openalex.org/W1634343840","https://openalex.org/W3206713834"],"abstract_inverted_index":{"We":[0,113,192],"present":[1,149],"techniques":[2,198],"for":[3,9,32,102,174],"efficient":[4],"computation":[5],"of":[6,71,105,108,196],"points-to":[7,24,109],"information":[8,25,29,110,184],"C":[10],"programs.":[11],"Pointer":[12],"analysis":[13,57,210,216],"is":[14,30,66,122],"an":[15,96],"important":[16],"phase":[17],"in":[18,84,95,123,127,140,158,166,185],"the":[19,27,61,69,85,92,116,124,128,186,194,209],"compilation":[20],"process.":[21],"The":[22],"computed":[23],"and":[26,47,78,99,138,164,169,204,219],"alias":[28],"useful":[31],"client":[33],"analyses":[34,135],"from":[35],"varied":[36],"domains":[37],"such":[38],"as":[39],"bug":[40],"finding,":[41],"data-flow":[42],"analysis,":[43],"identifying":[44],"security":[45],"vulnerabilities,":[46],"parallelization,":[48],"to":[49,91,119,132],"name":[50],"a":[51,141,155,159,171,213],"few.":[52],"Former":[53],"research":[54],"on":[55],"pointer":[56],"has":[58],"indicated":[59],"that":[60,115,206],"main":[62],"bottleneck":[63],"towards":[64],"scalability":[65],"manifested":[67],"by":[68,217,223],"presence":[70],"complex":[72],"constraints":[73,88],"(load":[74],"p":[75],"=":[76,81],"*q":[77],"store":[79],"*p":[80],"q":[82],"constraints)":[83],"program.":[86],"Complex":[87],"add":[89],"edges":[90],"constraint":[93,129,156,187],"graph":[94,157,188],"unpredictable":[97],"manner":[98],"are":[100],"responsible":[101],"initiating":[103],"propagation":[104,181],"large":[106,201],"amounts":[107],"across":[111],"edges.":[112],"identify":[114],"root":[117],"cause":[118],"this":[120],"issue":[121],"homogeneous":[125],"structure":[126],"graph,":[130],"due":[131],"which":[133,182],"existing":[134],"treat":[136,162],"loads":[137,163],"stores":[139,165],"uniform":[142],"manner.":[143],"To":[144],"address":[145],"these":[146],"issues,":[147],"we":[148,153,178],"two":[150],"techniques.":[151],"First,":[152],"represent":[154],"non-homogeneous":[160],"manner,":[161],"different":[167],"ways,":[168],"employ":[170],"push-pull":[172],"model":[173],"non-uniform":[175],"propagation.":[176],"Second,":[177],"propose":[179],"lazy":[180],"propagates":[183],"only":[189],"when":[190],"necessary.":[191],"illustrate":[193],"effectiveness":[195],"our":[197],"using":[199],"six":[200],"open-source":[202],"programs":[203],"show":[205],"they":[207],"improve":[208],"time":[211],"over":[212,220],"state-of-the-art":[214],"BDD-based":[215],"33%":[218],"Deep":[221],"Propagation":[222],"21%.":[224]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}