Issue No. 11 - November (1990 vol. 23)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/2.60878
<p>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.</p>
M. V. Zelkowitz, "A Functional Correctness Model of Program Verification," in Computer, vol. 23, no. , pp. 30-39, 1990.