This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
July 1979 (vol. 5 no. 4)
pp. 402-417
T.E. Cheatham, Center for Research in Computing Technology, Harvard University
Symbolic evaluation is a form of static program analysis in which symbolic expressions are used to denote the values of program variables and computations. It does not require the user to specify which path at a conditional branch to follow nor how many cycles of a loop to consider. Instead, a symbolic evaluator uses conditional expressions to represent the uncertainty that arises from branching and develops and attempts to solve recurrence relations that describe the behavior of loop variables.
Index Terms:
symbolic evaluation, Automatic program analysis, expression simplification, first-order recurrence relations, program optimization, program verification
Citation:
T.E. Cheatham, G.H. Holloway, J.A. Townley, "Symbolic Evaluation and the Analysis of Programs," IEEE Transactions on Software Engineering, vol. 5, no. 4, pp. 402-417, July 1979, doi:10.1109/TSE.1979.234207
Usage of this product signifies your acceptance of the Terms of Use.