The Qualified Function Approach to Analysis of Program Behavior and Performance

Authors:
Armen Gabrielian;Lawrence P. McNamee;David J. Trawick
Affiliations:
Hughes Aircraft Company, Fullerton, CA;Hughes Aircraft Company, Fullerton, CA;Hughes Aircraft Company, Fullerton, CA
Venue:
IEEE Transactions on Software Engineering - Annals of discrete mathematics, 24
Year:
1985

Citing 0
Cited 3

Micro Time Cost Analysis of Parallel Computations

IEEE Transactions on Computers
Meet Real-Time Requirements of Parallel Programs and Maximally Utilize System Resources

IEEE Transactions on Software Engineering
A mathematical model to estimate average response time of parallel programs

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.02

Visualization

Abstract

The notion of a qualified function is introduced as a general means of representing the parameters of dynamic systems. Two specific types of qualified functions are defined for the analysis of the behavior and performance of structured programs. Transformation functions represent the values of variables during execution and timing algorithms express the execution times of programs symbolically. Complete rules of derivation for transformation functions and timing algorithms are given for the control mechanisms of sequence, selection, fixed loop, and while statement. Deterministic and stochastic simplification of transformation functions and timing algorithms are investigated and methods of eliminating recursion for expressions corresponding to while statements are studied.