{"id":"https://openalex.org/W7339949","doi":null,"title":"Interprocedural analysis useless for code optimization","display_name":"Interprocedural analysis useless for code optimization","publication_year":1987,"publication_date":"1987-11-01","ids":{"openalex":"https://openalex.org/W7339949","mag":"7339949"},"language":"en","primary_location":{"id":"mag:7339949","doi":null,"is_oa":false,"landing_page_url":"http://i.stanford.edu/pub/cstr/reports/csl/tr/87/342/CSL-TR-87-342.pdf","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/A5059607447","display_name":"Stephen Richardson","orcid":"https://orcid.org/0000-0003-4359-3638","observed_orcids":["https://orcid.org/0000-0003-4359-3638"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stephen Richardson","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-4359-3638","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5083750533","display_name":"Mahadevan Ganapathi","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mahadevan Ganapathi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.00147167,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9452999830245972,"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.9452999830245972,"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.043800000101327896,"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.0020000000949949026,"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/interprocedural-data-flow-analysis","display_name":"interprocedural data flow analysis","score":0.9649999737739563},{"id":"https://openalex.org/keywords/program-optimization","display_name":"program optimization","score":0.7609999775886536},{"id":"https://openalex.org/keywords/flow-insensitive-analysis","display_name":"flow-insensitive analysis","score":0.7590000033378601},{"id":"https://openalex.org/keywords/program-summaries","display_name":"program summaries","score":0.41600000858306885},{"id":"https://openalex.org/keywords/program-execution-speed","display_name":"program execution speed","score":0.6589999794960022}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8590275645256042},{"id":"https://openalex.org/C75608658","wikidata":"https://www.wikidata.org/wiki/Q44395","display_name":"Pascal (unit)","level":2,"score":0.6748896837234497},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6252990961074829},{"id":"https://openalex.org/C88468194","wikidata":"https://www.wikidata.org/wiki/Q1172416","display_name":"Data-flow analysis","level":3,"score":0.5968997478485107},{"id":"https://openalex.org/C111564260","wikidata":"https://www.wikidata.org/wiki/Q4288856","display_name":"Interprocedural optimization","level":5,"score":0.5918651223182678},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5866352319717407},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.5443666577339172},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.46934473514556885},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.45611119270324707},{"id":"https://openalex.org/C139571649","wikidata":"https://www.wikidata.org/wiki/Q1156793","display_name":"Program optimization","level":3,"score":0.4226286709308624},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4129175543785095},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3679030239582062},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3273639678955078},{"id":"https://openalex.org/C489000","wikidata":"https://www.wikidata.org/wiki/Q747385","display_name":"Data flow diagram","level":2,"score":0.3226187229156494},{"id":"https://openalex.org/C29331672","wikidata":"https://www.wikidata.org/wiki/Q3354468","display_name":"Loop optimization","level":4,"score":0.17740103602409363},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.10196518898010254},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.08279067277908325}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:7339949","doi":null,"is_oa":false,"landing_page_url":"http://i.stanford.edu/pub/cstr/reports/csl/tr/87/342/CSL-TR-87-342.pdf","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":21,"referenced_works":["https://openalex.org/W110734221","https://openalex.org/W148396834","https://openalex.org/W1501703237","https://openalex.org/W1504162836","https://openalex.org/W1522286888","https://openalex.org/W1966449927","https://openalex.org/W1972073638","https://openalex.org/W2003011196","https://openalex.org/W2023222549","https://openalex.org/W2025554746","https://openalex.org/W2028809124","https://openalex.org/W2038282408","https://openalex.org/W2048683749","https://openalex.org/W2060630116","https://openalex.org/W2092003307","https://openalex.org/W2094025586","https://openalex.org/W2096733429","https://openalex.org/W2123301443","https://openalex.org/W2143659699","https://openalex.org/W2162436812","https://openalex.org/W2293624369"],"related_works":["https://openalex.org/W1981131019","https://openalex.org/W168348267","https://openalex.org/W1963905457","https://openalex.org/W1999961006","https://openalex.org/W2042708654","https://openalex.org/W148396834","https://openalex.org/W1991133357","https://openalex.org/W119366505","https://openalex.org/W7100076060","https://openalex.org/W110734221"],"abstract_inverted_index":{"The":[0,43,54],"problem":[1],"of":[2,13,56,70,82],"tracking":[3],"data":[4,40],"flow":[5,41],"across":[6],"procedure":[7],"boundaries":[8],"has":[9],"a":[10,68,80],"long":[11],"history":[12],"theoretical":[14],"study":[15],"by":[16],"people":[17],"who":[18],"believed":[19],"that":[20,75],"such":[21],"information":[22,59,85],"would":[23],"be":[24],"useful":[25],"for":[26,38],"code":[27],"optimization.":[28],"Building":[29],"upon":[30],"previous":[31],"work,":[32],"we":[33,73],"have":[34],"implemented":[35],"an":[36,63],"algorithm":[37,44],"interprocedural":[39,83],"analysis.":[42],"produces":[45],"three":[46],"flow-insensitive":[47],"summary":[48,84],"sets:":[49],"MOD,":[50],"USE,":[51],"and":[52],"ALIASES.":[53],"utility":[55],"the":[57],"resulting":[58],"was":[60],"investigated":[61],"using":[62],"optimizing":[64],"Pascal":[65],"compiler.":[66],"Over":[67],"sampling":[69],"27":[71],"benchmarks,":[72],"found":[74],"additional":[76],"optimizations":[77],"performed":[78],"as":[79],"result":[81],"contributed":[86],"almost":[87],"nothing":[88],"to":[89],"program":[90],"execution":[91],"speed.":[92]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-11-06T12:05:46.655746","created_date":"2016-06-24T00:00:00"}