{"id":"https://openalex.org/W79676834","doi":null,"title":"Interprocedural array data-flow analysis","display_name":"Interprocedural array data-flow analysis","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W79676834","mag":"79676834"},"language":"en","primary_location":{"id":"mag:79676834","doi":null,"is_oa":false,"landing_page_url":"https://conservancy.umn.edu/handle/11299/215339","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5013423965","display_name":"Zhiyuan Li Lee","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhiyuan Li Lee","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5084753684","display_name":"Junjie Gu","orcid":"https://orcid.org/0000-0002-8593-4288","observed_orcids":["https://orcid.org/0000-0002-8593-4288"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Junjie Gu","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-8593-4288","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.514,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.65018684,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9750999808311462,"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.9750999808311462,"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/T10126","display_name":"Logic, programming, and type systems","score":0.018400000408291817,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.0006000000284984708,"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/interprocedural-analysis","display_name":"interprocedural analysis","score":0.9819999933242798},{"id":"https://openalex.org/keywords/loop-parallelization","display_name":"loop parallelization","score":0.9919999837875366},{"id":"https://openalex.org/keywords/set-difference","display_name":"set difference","score":0.44699999690055847},{"id":"https://openalex.org/keywords/program-parallelization","display_name":"program parallelization","score":0.6190000176429749}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8191748857498169},{"id":"https://openalex.org/C88468194","wikidata":"https://www.wikidata.org/wiki/Q1172416","display_name":"Data-flow analysis","level":3,"score":0.7839311361312866},{"id":"https://openalex.org/C146064661","wikidata":"https://www.wikidata.org/wiki/Q186152","display_name":"Array data structure","level":2,"score":0.6412486433982849},{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.6350358724594116},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5662940144538879},{"id":"https://openalex.org/C160191386","wikidata":"https://www.wikidata.org/wiki/Q868299","display_name":"Control flow","level":2,"score":0.5238737463951111},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.5187378525733948},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5161841511726379},{"id":"https://openalex.org/C489000","wikidata":"https://www.wikidata.org/wiki/Q747385","display_name":"Data flow diagram","level":2,"score":0.5100939869880676},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.47256746888160706},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4475739598274231},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3553813397884369},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35314321517944336},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.32730013132095337},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.1856919825077057},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1280701458454132},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:79676834","doi":null,"is_oa":false,"landing_page_url":"https://conservancy.umn.edu/handle/11299/215339","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2168822173","https://openalex.org/W1536644396","https://openalex.org/W2102424054","https://openalex.org/W2002130785","https://openalex.org/W1554715164","https://openalex.org/W1878042260","https://openalex.org/W1993084860","https://openalex.org/W7099826945","https://openalex.org/W7098597057","https://openalex.org/W2152408910"],"abstract_inverted_index":{"Array":[0],"data-flow":[1,28,55,68,131,196],"analysis":[2,29,60,69,132,176],"is":[3,24,70,270],"known":[4,157],"to":[5,8,41,120,127,137,224,250],"be":[6,31,165,178,239],"crucial":[7],"the":[9,16,43,73,122,147,226,229],"success":[10],"of":[11,15,75,116,149],"array":[12,27,54,67,77,97,102,130,143,154,195],"privatization,":[13],"one":[14],"most":[17],"important":[18],"techniques":[19],"for":[20,57,82,152],"program":[21,175],"parallelization.":[22],"It":[23],"clear":[25],"that":[26,37,84,267],"should":[30,177],"performed":[32,240],"interprocedurally":[33],"and":[34,36,61,79,90,104,135,189,204,247,273],"symbolically,":[35],"it":[38],"often":[39],"needs":[40],"handle":[42,138],"predicates":[44,215],"represented":[45],"by":[46,206,241],"IF":[47,125],"conditions.\r\nIn":[48],"this":[49],"thesis,":[50],"we":[51],"first":[52],"summarize":[53],"approaches":[56],"both":[58,271],"intraprocedural":[59],"interprocedural":[62,66],"analysis.":[63],"Then":[64],"our":[65,129,186,201,222,268],"presented":[71],"with":[72],"intent":[74],"supporting":[76],"privatization":[78],"loop":[80],"parallelization":[81],"programs":[83],"have":[85,199],"arbitrary":[86],"control":[87,111],"flow":[88,112],"graphs":[89],"acyclic":[91],"call":[92],"graphs.":[93],"Our":[94,263],"scheme":[95],"summarizes":[96],"access":[98],"information":[99,123,256],"using":[100],"guarded":[101,142],"regions":[103,107,144,155],"propagates":[105],"such":[106,172],"over":[108],"a":[109,173],"hierarchical":[110],"graph.":[113],"The":[114,141],"use":[115,121],"guards":[117],"allows":[118,221],"us":[119],"in":[124,162,191,228],"conditions":[126],"make":[128],"more":[133],"accurate":[134],"thereby":[136],"difficult":[139],"cases.":[140],"also":[145,170,184,259],"retain":[146],"simplicity":[148],"set":[150,209,212,219],"operations":[151,254],"regular":[153,160],"(also":[156],"as":[158],"bounded":[159],"sections)":[161],"common":[163],"cases.\r\nTo":[164],"not":[166],"only":[167],"effective":[168,203,272],"but":[169],"efficient,":[171],"powerful":[174],"carefully":[179,207],"designed.":[180],"This":[181,258],"thesis":[182],"will":[183],"discuss":[185],"research":[187],"experiments":[188],"experience":[190],"building":[192],"an":[193],"efficient":[194,205],"analyzer.":[197],"We":[198],"made":[200],"analyzer":[202,223,269],"choosing":[208],"representation,":[210],"delaying":[211],"difference,":[213],"representing":[214],"hierarchically,":[216],"etc.":[217],"Delaying":[218],"difference":[220,227,253],"compute":[225],"right":[230],"order":[231],"(e.g.":[232],"$(u":[233,242],"-":[234,236,243,245],"w1)":[235],"w2$":[237],"can":[238],"w2)":[244],"w1),$":[246],"thus":[248],"helps":[249],"avoid":[251],"unnecessary":[252],"during":[255],"propagation.":[257],"simplifies":[260],"intersection":[261],"operations.":[262],"experimental":[264],"results":[265],"show":[266],"efficient.":[274]},"counts_by_year":[],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-06-24T00:00:00"}