Profitability computations on program flow graphs

DOI10.1016/0898-1221(76)90027-4zbMath0367.68027OpenAlexW2072568290MaRDI QIDQ1242449

John Cocke, Ken Kennedy

Publication date: 1976

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(76)90027-4

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) General topics in the theory of software (68N01)

Related Items (1)

A composite algorithm for strength reduction and code movement optimization

Cites Work

• Fast algorithms for the elimination of common subexpressions
• Characterizations of Reducible Flow Graphs
• An algorithm for tracing live variables based on a straightened program graph
• A Comparison of Two Algorithms for Global Data Flow Analysis
• Some Topics in Code Optimization
• The theory of languages
• Analysis of Graphs by Ordering of Nodes
• An empirical study of FORTRAN programs
• A global flow analysis algorithm
• Flow Graph Reducibility
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Profitability computations on program flow graphs