This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
January 1983 (vol. 9 no. 1)
pp. 103-108
R.R. Oldehoeft, Department of Computer Science, Colorado State University
This paper describes a technique for predicting the execution behavior of a source program or a software design specification. As a by-product of syntactic analysis, a program graph is constructed which can subsequently be treated as the graph of a finite automaton. The expression for execution behavior is the regular expression of the graph. Several simplification techniques for these expressions are discussed and exemplified. In particular, the substitution of known values for program segments followed by constant folding cannot be done indiscriminately; the allowable situations are characterized. Applications include the prediction of execution time for a program or a software design, other forms of language analysis, and program restructuring.
Index Terms:
regular expressions, Constant folding, control flow analysis, performance prediction, program graphs
Citation:
R.R. Oldehoeft, "Program Graphs and Execution Behavior," IEEE Transactions on Software Engineering, vol. 9, no. 1, pp. 103-108, Jan. 1983, doi:10.1109/TSE.1983.236300
Usage of this product signifies your acceptance of the Terms of Use.