{"id":"https://openalex.org/W1974909417","doi":"https://doi.org/10.1145/567532.567556","title":"A precise inter-procedural data flow algorithm","display_name":"A precise inter-procedural data flow algorithm","publication_year":1981,"publication_date":"1981-01-01","ids":{"openalex":"https://openalex.org/W1974909417","doi":"https://doi.org/10.1145/567532.567556","mag":"1974909417"},"language":"en","primary_location":{"id":"doi:10.1145/567532.567556","doi":"https://doi.org/10.1145/567532.567556","is_oa":true,"landing_page_url":"https://doi.org/10.1145/567532.567556","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/567532.567556","source":{"id":"https://openalex.org/S7407088133","display_name":"ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)","issn_l":null,"issn":null,"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 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '81","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/567532.567556","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068657716","display_name":"Eugene W. Myers","orcid":"https://orcid.org/0000-0002-6580-7839","observed_orcids":["https://orcid.org/0000-0002-6580-7839","https://orcid.org/0000-0001-8759-8663","https://orcid.org/0009-0003-3523-7307"]},"institutions":[{"id":"https://openalex.org/I188538660","display_name":"University of Colorado Boulder","ror":"https://ror.org/02ttsq026","country_code":"US","type":"education","lineage":["https://openalex.org/I188538660"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Eugene M. Myers","raw_affiliation_strings":["University of Colorado at Boulder, Boulder, Colorado"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Colorado at Boulder, Boulder, Colorado","institution_ids":["https://openalex.org/I188538660"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5068657716"],"corresponding_institution_ids":["https://openalex.org/I188538660"],"apc_list":null,"apc_paid":null,"fwci":1.3773,"has_fulltext":true,"cited_by_count":213,"citation_normalized_percentile":{"value":0.73717949,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"219","last_page":"230"},"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.9833999872207642,"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.9833999872207642,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.0020000000949949026,"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/T10260","display_name":"Software Engineering Research","score":0.00139999995008111,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/aliasing","display_name":"aliasing","score":0.7699999809265137},{"id":"https://openalex.org/keywords/recursion","display_name":"recursion","score":0.8889999985694885},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.8460000157356262},{"id":"https://openalex.org/keywords/flow-graphs","display_name":"flow graphs","score":0.703000009059906}],"concepts":[{"id":"https://openalex.org/C4069607","wikidata":"https://www.wikidata.org/wiki/Q868732","display_name":"Aliasing","level":3,"score":0.7843320965766907},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.752678394317627},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6442373394966125},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6261018514633179},{"id":"https://openalex.org/C88468194","wikidata":"https://www.wikidata.org/wiki/Q1172416","display_name":"Data-flow analysis","level":3,"score":0.5558847188949585},{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.5512800216674805},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5065003633499146},{"id":"https://openalex.org/C489000","wikidata":"https://www.wikidata.org/wiki/Q747385","display_name":"Data flow diagram","level":2,"score":0.4927575886249542},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.483224481344223},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4459196925163269},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41385582089424133},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4134630560874939},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.221367746591568},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.1298029124736786},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1117972731590271},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/567532.567556","doi":"https://doi.org/10.1145/567532.567556","is_oa":true,"landing_page_url":"https://doi.org/10.1145/567532.567556","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/567532.567556","source":{"id":"https://openalex.org/S7407088133","display_name":"ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)","issn_l":null,"issn":null,"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 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '81","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/567532.567556","doi":"https://doi.org/10.1145/567532.567556","is_oa":true,"landing_page_url":"https://doi.org/10.1145/567532.567556","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/567532.567556","source":{"id":"https://openalex.org/S7407088133","display_name":"ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)","issn_l":null,"issn":null,"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 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '81","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1974909417.pdf","grobid_xml":"https://content.openalex.org/works/W1974909417.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W110734221","https://openalex.org/W1966449927","https://openalex.org/W2011039300","https://openalex.org/W2016558072","https://openalex.org/W2036265926","https://openalex.org/W2047615655","https://openalex.org/W2049133215","https://openalex.org/W2050464392","https://openalex.org/W2088017390","https://openalex.org/W2116098983","https://openalex.org/W2123301443","https://openalex.org/W2124153277","https://openalex.org/W2150082535","https://openalex.org/W2162436812","https://openalex.org/W4252737723","https://openalex.org/W4285719527","https://openalex.org/W6630569239"],"related_works":["https://openalex.org/W2011143944","https://openalex.org/W2051345428","https://openalex.org/W2048683749","https://openalex.org/W1588620728","https://openalex.org/W2092003307","https://openalex.org/W2567546000","https://openalex.org/W2038282408","https://openalex.org/W6921493575","https://openalex.org/W3157273867","https://openalex.org/W7099877924"],"abstract_inverted_index":{"Data":[0],"flow":[1,30,42,71],"analysis":[2],"is":[3,57,65,75,91,97],"well":[4],"understood":[5],"at":[6],"the":[7,28,50,66,69,82,88,101,104,109],"intra-procedural":[8],"level":[9],"and":[10,23,39,73,99],"efficient":[11],"algorithms":[12],"are":[13,26,44],"available.":[14],"When":[15],"inter-procedural":[16],"mechanisms":[17],"such":[18],"as":[19],"recursion,":[20],"procedure":[21],"nesting,":[22],"pass-by-reference":[24],"aliasing":[25,85],"introduced,":[27],"data":[29,41],"problems":[31,43],"become":[32],"much":[33],"more":[34],"difficult.":[35],"The":[36],"avail,":[37],"live,":[38],"must-summary":[40],"shown":[45],"to":[46],"be":[47],"NP-complete":[48],"in":[49,94],"presence":[51],"of":[52,68,84,87,103,106,108],"aliasing.":[53],"However,":[54],"an":[55],"algorithm":[56],"presented":[58],"with":[59],"O(SET*EDGE)":[60],"time":[61],"performance":[62],"where":[63],"EDGE":[64],"size":[67],"program's":[70],"graph":[72],"SET":[74,96],"a":[76],"possible":[77],"exponential":[78],"number":[79,83,105],"which":[80],"reflects":[81],"patterns":[86],"program.":[89,110],"It":[90],"argued":[92],"that":[93],"practice":[95],"small":[98],"on":[100],"order":[102],"variables":[107]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}