An empirical study of FORTRAN programs

DOI10.1002/SPE.4380010203zbMATH Open0243.68003OpenAlexW2092492242MaRDI QIDQ5654998FDOQ5654998

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)

Cited In (18)

• 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
• Optimal measurement points for program frequency counts
• Properties of data flow frameworks: A unified model
• On frequency analysis of sequential program code execution
• Tuning architecture via microprogramming
• The complexity of data flow criteria for test data selection
• Circular attribute grammars with remote attribute references and their evaluators
• Inner loops in flowgraphs and code optimization
• Pathlistings applied to data flow analysis
• A numerical analysis of two point boundary value problem algorithms
• Loop cleaning
• Speeding sort algorithms by special instructions
• Analysis of program optimization possibilities and further development
• Bounds on the parallel evaluation of arithmetic expressions using associativity and commutativity
• Node listings for reducible flow graphs

This page was built for publication: An empirical study of FORTRAN programs

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