Profitability computations on program flow graphs
type: Item
instance of: scholarly article
title: Profitability computations on program flow graphs
zbMATH Open document ID: 0367.68027
DOI: 10.1016/0898-1221(76)90027-4
author: John Cocke
author: Ken Kennedy
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 68N01
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 3573245
MaRDI profile type: Publication
full work available at URL: 0898-1221(76)90027-4
OpenAlex ID: W2072568290
cites work: An empirical study of FORTRAN programs
cites work: Q5585020
cites work: Flow Graph Reducibility
cites work: Q5657644
cites work: Q4125700
cites work: Q5545069
cites work: A Comparison of Two Algorithms for Global Data Flow Analysis
cites work: Fast algorithms for the elimination of common subexpressions
cites work: A global flow analysis algorithm
cites work: The theory of languages
cites work: Characterizations of Reducible Flow Graphs
cites work: Q4068060
cites work: An algorithm for tracing live variables based on a straightened program graph
cites work: Analysis of Graphs by Ordering of Nodes
cites work: Some Topics in Code Optimization
cites work: Q4770975
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 3573245