This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Functional Correctness Model of Program Verification
November 1990 (vol. 23 no. 11)
pp. 30-39

A model whose verification conditions depend only on elementary symbolic execution of a trace table is presented. The method is applied to rather simple programs. However, even in large complex implementations, the techniques can be applied informally to determine the functionality of complex interactions. The technique is easy to learn (it is used in a freshman computer science course) and lends itself to automation.

Citation:
Marvin V. Zelkowitz, "A Functional Correctness Model of Program Verification," Computer, vol. 23, no. 11, pp. 30-39, Nov. 1990, doi:10.1109/2.60878
Usage of this product signifies your acceptance of the Terms of Use.