This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Qualified Function Approach to Analysis of Program Behavior and Performance
August 1985 (vol. 11 no. 8)
pp. 758-773
A. Gabrielian, Command and Control Systems Division, Ground Systems Group, Hughes Aircraft Company
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.
Index Terms:
timing algorithm, Difference equations, performance evaluation, program execution times, qualified function, symbolic evaluation, symbolic execution, system modeling
Citation:
A. Gabrielian, L.P. McNamee, D.J. Trawick, "The Qualified Function Approach to Analysis of Program Behavior and Performance," IEEE Transactions on Software Engineering, vol. 11, no. 8, pp. 758-773, Aug. 1985, doi:10.1109/TSE.1985.232525
Usage of this product signifies your acceptance of the Terms of Use.