An empirical study of FORTRAN programs

DOI10.1002/spe.4380010203zbMath0243.68003OpenAlexW2092492242MaRDI QIDQ5654998

Donald E. Knuth

Publication date: 1971

Published in: Software: Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/spe.4380010203

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items

Tuning architecture via microprogramming, Speeding sort algorithms by special instructions, Inner loops in flowgraphs and code optimization, Pathlistings applied to data flow analysis, Properties of data flow frameworks: A unified model, A numerical analysis of two point boundary value problem algorithms, Optimal measurement points for program frequency counts, Circular attribute grammars with remote attribute references and their evaluators, Bounds on the parallel evaluation of arithmetic expressions using associativity and commutativity, The complexity of data flow criteria for test data selection, Node listings for reducible flow graphs, Profitability computations on program flow graphs, Finding the depth of a flow graph, An experimental investigation of Geschke's method of global program optimization, Bibliography on the evaluation of numerical software, On frequency analysis of sequential program code execution, Loop cleaning, Analysis of program optimization possibilities and further development