An empirical study of FORTRAN programs

DOI10.1002/SPE.4380010203MaRDI QIDQ5654998zbMATH OpenOpenAlexFDO

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

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

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)