Profitability computations on program flow graphs

DOI10.1016/0898-1221(76)90027-4MaRDI QIDQ1242449zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• A Comparison of Two Algorithms for Global Data Flow Analysis
• A global flow analysis algorithm
• An algorithm for tracing live variables based on a straightened program graph
• An empirical study of FORTRAN programs
• Analysis of Graphs by Ordering of Nodes
• Characterizations of Reducible Flow Graphs
• Fast algorithms for the elimination of common subexpressions
• Flow Graph Reducibility
• scientific article; zbMATH DE number 3485178 (Why is no real title available?)
• scientific article; zbMATH DE number 3551830 (Why is no real title available?)
• scientific article; zbMATH DE number 3446921 (Why is no real title available?)
• scientific article; zbMATH DE number 3256930 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3388535 (Why is no real title available?)
• Some Topics in Code Optimization
• The theory of languages

Cited in

(1)

• A composite algorithm for strength reduction and code movement optimization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1242449)